Related papers: Enumeration of interval graphs and $d$-representab…
We determine an asymptotic formula for the number of labelled 2-connected (simple) graphs on $n$ vertices and $m$ edges, provided that $m-n\to\infty$ and $m=O(n\log n)$ as $n\to\infty$. This is the entire range of $m$ not covered by…
The theory of $k$-regular graphs is closely related to group theory. Every $k$-regular, bipartite graph is a Schreier graph with respect to some group $G$, a set of generators $S$ (depending only on $k$) and a subgroup $H$. The goal of this…
We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere. This is achieved by introducing a type of group presentation…
We calculate the asymptotic value of the choice number of complete multi-partite graphs.
Given the degree sequence $d$ of a graph, the realization graph of $d$ is the graph having as its vertices the labeled realizations of $d$, with two vertices adjacent if one realization may be obtained from the other via an edge-switching…
We give asymptotics for the cumulative distribution function (CDF) for degrees of large dense random graphs sampled from a graphon. The proof is based on precise asymptotics for binomial random variables. Replacing the indicator function in…
The nonsingular real plane algebraic curves of given degree $d$ are considered either up to isotopy or up to deformation. The asymptotic behavior of the number $I_d$ of isotopy classes and the number $D_d$ of deformation classes are…
We propose a universal approach to a range of enumeration problems in graphs. The key point is in contracting suitably chosen symmetric tensors placed at the vertices of a graph along the edges. In particular, this leads to an algorithm…
The recently introduced problem of extending partial interval representations asks, for an interval graph with some intervals pre-drawn by the input, whether the partial representation can be extended to a representation of the entire…
The linear finite irreducible representations of the algebra of the 1D $N$-Extended Supersymmetric Quantum Mechanics are discussed in terms of their "connectivity" (a symbol encoding information on the graphs associated to the irreps). The…
We present here random distributions on $(D+1)$-edge-colored, bipartite graphs with a fixed number of vertices $2p$. These graphs are dual to $D$-dimensional orientable colored complexes. We investigate the behavior of quantities related to…
We enumerate complex curves on toric surfaces of any given degree and genus, having a single cusp and nodes as their singularities, and matching appropriately many point constraints. The solution is obtained via tropical enumerative…
We estimate the number of integer solutions to decomposable form inequalities (both asymptotic estimates and upper bounds are provided) when the degree of the form and the number of variables are relatively prime. These estimates display…
We derive an asymptotic formula for the number of connected 3-uniform hypergraphs with vertex set $[N]$ and $M$ edges for $M=N/2+R$ as long as $R$ satisfies $R = o(N)$ and $R=\omega(N^{1/3}\ln^{2} N)$. This almost completely fills the gap…
We suggest two related conjectures dealing with the existence of spanning irregular subgraphs of graphs. The first asserts that any $d$-regular graph on $n$ vertices contains a spanning subgraph in which the number of vertices of each…
In this paper, we introduce random walks with absorbing states on simplicial complexes. Given a simplicial complex of dimension $d$, a random walk with an absorbing state is defined which relates to the spectrum of the $k$-dimensional…
Fix a sequence of $d$-regular graphs $(G_d)_{d\in \mathbb{N}}$ and denote by $G_{d,p}$ the graph obtained from $G_d$ after edge-percolation with probability $p=c/d$, for a constant $c>0$. We prove a quantitative local convergence of…
Linek's 1989 problem asks whether the numbers of independent sets of trees avoid infinitely many positive integers. We show that the set of natural numbers realized as the number of independent sets of a tree has a lower growth exponent of…
A 1d random geometric graph (1d RGG) is built by joining a random sample of $n$ points from an interval of the real line with probability $p$. We count the number of $k$-hop paths between two vertices of the graph in the case where the…
We study the following inverse graph-theoretic problem: how many vertices should a graph have given that it has a specified value of some parameter. We obtain asymptotic for the minimal number of vertices of the graph with the given number…