相关论文: Large-scale geometry of Borel graphs of polynomial…

Let $G$ be a Borel graph all of whose finite subgraphs embed into the $d$-dimensional grid with diagonals. We show that then $G$ itself admits a Borel embedding into the Schreier graph of a free Borel action of $\mathbb Z^{O(d)}$. This…

Bonamy et al \cite{BBEGLPS} showed that graphs of polynomial growth have finite asymptotic dimension. We refine their result showing that a graph of polynomial growth strictly less than $n^{k+1}$ has asymptotic dimension at most $k$. As a…

Asymptotic separation index is a parameter that measures how easily a Borel graph can be approximated by its subgraphs with finite components. In contrast to the more classical notion of hyperfiniteness, asymptotic separation index is…

Let $(X,\tau)$ be a Polish space with Borel probability measure $\mu,$ and $G$ a locally finite one-ended Borel graph on $X.$ We show that $G$ admits a Borel one-ended spanning tree generically. If $G$ is induced by a free Borel action of…

We prove a conjecture of Bonamy, Bousquet, Pilipczuk, Rz\k{a}\.zewski, Thomass\'e, and Walczak, that for every graph $H$, there is a polynomial $p$ such that for every positive integer $s$, every graph of average degree at least $p(s)$…

Let $G$ be a dense graph with good expansion properties and not too close to being bipartite. Let $\boldsymbol d$ be a graphical degree sequence. Under very weak conditions, we find the number of subgraphs of $G$ with degree sequence…

We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…

Asymptotic expansions of Gaussian integrals may often be interpreted as generating functions for certain combinatorial objects (graphs with additional data). In this article we discuss a general approach to all such cases using colored…

The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. When restricted to graphs and their shortest paths metric, the asymptotic dimension can be seen as a large scale…

We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…

We bound the volume of thick embeddings of finite graphs into the Heisenberg group, as well as the volume of coarse wirings of finite graphs into groups with polynomial growth. This work follows the work of Kolmogorov-Brazdin, Gromov-Guth…

We get asymptotics for the volume of large balls in an arbitrary locally compact group G with polynomial growth. This is done via a study of the geometry of G and a generalization of P. Pansu's thesis. In particular, we show that any such G…

We give a method of generating strongly polynomial sequences of graphs, i.e., sequences $(H_{\mathbf{k}})$ indexed by a multivariate parameter $\mathbf{k}=(k_1,\ldots, k_h)$ such that, for each fixed graph $G$, there is a multivariate…

In a previous paper Hua-Jost-Liu, we have applied Alexandrov geometry methods to study infinite semiplanar graphs with nonnegative combinatorial curvature. We proved the weak relative volume comparison and the Poincar\'e inequality on these…

We take an elementary and systematic approach to the problem of extending the Tutte polynomial to the setting of embedded graphs. Four notions of embedded graphs arise naturally when considering deletion and contraction operations on graphs…

In this paper, we focus on the study of immanantal polynomials for linear combination matrices composed of the degree matrix and adjacency matrix of a graph. First, applying the concept of vertex orientation for general graphs, we provide a…

The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. In this paper, we study the asymptotic dimension of metric spaces generated by graphs and their shortest path metric…

We prove various obstructions to the existence of regular maps (or coarse embeddings) between commonly studied spaces. For instance, there is no regular map (or coarse embedding) $\mathbb H^n\to\mathbb H^{n-1}\times Y$ for $n\geq 3$, or…

We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\ell$ in a $d$-regular graph on $N$ vertices. For $\frac{2\ell}{N}$ bounded away from 0 and 1, the logarithm of…

Asymptotic expansions are given for large values of $n$ of the generalized Bessel polynomials $Y_n^\mu(z)$. The analysis is based on integrals that follow from the generating functions of the polynomials. A new simple expansion is given…