Related papers: On Counting Constructions and Isomorphism Classes …
We prove that the asymptotic entropy of large simple graphs, as a function of fixed edge and triangle densities, is nondifferentiable along a certain curve.
We present a unified general method for the asymptotic study of graphs from the so-called "subcritical"$ $ graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works…
In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…
We show the existence of generalized clusters of a finite or even infinite number of sets, with minimal total perimeter and given total masses, in metric measure spaces homogeneous with respect to a group acting by measure preserving…
The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
We study pairs and m--tuples of compositions of a positive integer n with parts restricted to a subset P of positive integers. We obtain some exact enumeration results for the number of tuples of such compositions having the same number of…
We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given…
In this paper we relate a fundamental parameter of a random graph, its degree sequence, to a simple model of nearly independent binomial random variables. This confirms a conjecture made in 1997. As a result, many interesting functions of…
We consider sparse random intersection graphs with the property that the clustering coefficient does not vanish as the number of nodes tends to infinity. We find explicit asymptotic expressions for the correlation coefficient of degrees of…
Let P_{n,m} denote the graph taken uniformly at random from the set of all planar graphs on {1,2,..., n} with exactly m(n) edges. We use counting arguments to investigate the probability that P_{n,m} will contain given components and…
In this note, we study non-transitive graphs and prove a number of results when they satisfy a coarse version of transitivity. Also, for each finitely generated group $G$, we produce continuum many pairwise non-quasi-isometric regular…
We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices. For every (finite) set of non-negative integers, we…
We use the convolution method for arithmetic functions of several variables to deduce an asymptotic formula for the number of $k$-tuples of positive integers with components which are pairwise non-coprime and $\le x$. More generally, we…
We propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The core idea is to encode the two-dimensional array of…
We show an asymptotic estimate for the number of labelled planar graphs on $n$ vertices. We also find limit laws for the number of edges, the number of connected components, and other parameters in random planar graphs.
Let X be a Hadamard manifold and $\Gamma$ a discrete group of isometries of X which contains an axial isometry without invariant flat half plane. We study the behavior of conformal densities on the geometric limit set of $\Gamma$ in order…
We find conditions for the connectivity of inhomogeneous random graphs with intermediate density. Our results generalize the classical result for G(n, p), when p = c log n/n. We draw n independent points X_i from a general distribution on a…
Given a minor-closed class $\mathcal{A}$ of graphs, let $\beta_{\mathcal{A}}$ denote the supremum over all graphs in $\mathcal{A}$ of the ratio of edges to vertices. We investigate the set $B$ of all such values $\beta_{\mathcal{A}}$,…
Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…