Results 61 to 70 of about 45,358 (192)
Approximate Itai–Zehavi Conjecture for Random Graphs
ABSTRACT A famous conjecture by Itai and Zehavi states that, for every d$$ d $$‐vertex‐connected graph G$$ G $$ and every vertex r$$ r $$ in G$$ G $$, there are d$$ d $$ spanning trees of G$$ G $$ such that, for every vertex v$$ v $$ in G∖{r}$$ G\setminus \left\{r\right\} $$, the paths between r$$ r $$ and v$$ v $$ in different trees are internally ...
Lawrence Hollom +4 more
wiley +1 more source
Connectivity of Inhomogeneous Random Graphs II
ABSTRACT Each graphon W:Ω2→[0,1]$$ W:{\Omega}^2\to \left[0,1\right] $$ yields an inhomogeneous random graph model 𝔾(n,W). We show that 𝔾(n,W) is asymptotically almost surely connected if and only if (i) W$$ W $$ is a connected graphon and (ii) the measure of elements of Ω$$ \Omega $$ of W$$ W $$‐degree less than α$$ \alpha $$ is o(α)$$ o\left(\alpha ...
Jan Hladký, Gopal Viswanathan
wiley +1 more source
Metric spaces with small rough angles and the rectifiability of rough self‐contracted curves
Abstract The small rough angle (SRA$\operatorname{SRA}$) condition, introduced by Zolotov in arXiv:1804.00234, captures the idea that all angles formed by triples of points in a metric space are small. In the first part of the paper, we develop the theory of metric spaces (X,d)$(X,d)$ satisfying the SRA(α)$\operatorname{SRA}(\alpha)$ condition for some
Estibalitz Durand Cartagena +1 more
wiley +1 more source
Symbolic Enumerative Combinatorics and Complex Asymptotic Analysis
Complex analysis is a fruitful source of asymptotic estimates in enumerative ...
Le Borgne +4 more
core
ENUMERATIVE COMBINATORICS ON DETERMINANTS AND SIGNED BIGRASSMANNIAN POLYNOMIALS [PDF]
As an application of linear algebra for enumerative combinatorics, we introduce two new ideas, signed bigrassmannian polynomials and bigrassmannian determinant.
Kobayashi, Masato
core +1 more source
Enumerative combinatorics on words [PDF]
Generating series, also called generating functions, play an important role in combinatorial mathematics. Many enumeration problems can be solved by transferring the basic operations on sets into algebraic operations on formal series leading to a solution of an enumeration problem.
openaire +2 more sources
Schubert varieties, linear codes and enumerative combinatorics
We consider linear error correcting codes associated to higher dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult questions in combinatorics and algebraic geometry.
Sudhir R. Ghorpade, Michael A. Tsfasman
openaire +3 more sources
Recent trends in combinatorics [PDF]
This volume presents some of the research topics discussed at the 2014-2015 Annual Thematic Program Discrete Structures: Analysis and Applications at the Institute for Mathematics and its Applications during Fall 2014, when combinatorics was the focus ...
Griggs, Jerrold +4 more
core +1 more source
A cyclic sieving phenomenon for symplectic tableaux [PDF]
Graeme Henrickson +2 more
doaj +1 more source
Algebraic and Geometric Methods in Enumerative Combinatorics [PDF]
A survey written for the upcoming "Handbook of Enumerative Combinatorics".
openaire +2 more sources

