Related papers: Strong almost finiteness
The Zykov ring of signed finite simple graphs with topological join as addition and compatible multiplication is an integral domain but not a unique factorization domain. We know that because by taking graph complements, it becomes…
An approach to the enumeration of feasible parameters for strongly regular graphs is described, based on the pair of structural parameters (a,c) and the positive eigenvalue e. The Krein bound ensures that there are only finitely many…
A systolic complex/bridged graph is fit when its (metric) intervals are "not too large". We prove that uniformly locally finite fit systolic complexes have Yu's Property A. In particular, groups acting properly on such complexes have…
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…
One deals with r-regular bipartite graphs with 2n vertices. In a previous paper Butera, Pernici, and the author have introduced a quantity d(i), a function of the number of i-matchings, and conjectured that as n goes to infinity the…
A near-factor of a finite simple graph $G$ is a matching that saturates all vertices except one. A graph $G$ is said to be near-factor-critical if the deletion of any vertex from $G$ results in a subgraph that has a near-factor. We prove…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
We prove that for every class of graphs $\mathcal{C}$ which is nowhere dense, as defined by Nesetril and Ossona de Mendez, and for every first order formula $\phi(\bar x,\bar y)$, whenever one draws a graph $G\in \mathcal{C}$ and a subset…
We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…
Alon, Krivelevich, and Sudakov conjectured in 1999 that for every finite graph $F$, there exists a quantity $c(F)$ such that $\chi(G) \leq (c(F) + o(1)) \Delta / \log\Delta$ whenever $G$ is an $F$-free graph of maximum degree $\Delta$. The…
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 propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…
Hyperfiniteness or amenability of measurable equivalence relations and group actions has been studied for almost fifty years. Recently, unexpected applications of hyperfiniteness were found in computer science in the context of testability…
We prove that if the Cayley graph of a finitely generated group enjoys the property L_delta then the group is almost convex and has a sub-cubic isoperimetric function.
We consider infinite graphs and the associated energy forms. We show that a graph is canonically compactifiable (i.e. all functions of finite energy are bounded) if and only if the underlying set is totally bounded with respect to any…
Let $G$ be a finitely generated group, $\mathrm{Sub}(G)$ the (compact, metric) space of all subgroups of $G$ with the Chaubuty topology and $X!$ the (Polish) group of all permutations of a countable set $X$. We show that the following…
For a large class of amenable transient weighted graphs $G$, we prove that the sign clusters of the Gaussian free field on $G$ fall into a regime of strong supercriticality, in which two infinite sign clusters dominate (one for each sign),…
In this note we show that the family of Cayley graphs of a finitely generated subgroup of ${\rm GL}_{n_0}(\mathbb{F}_p(t))$ modulo some admissible square-free polynomials is a family of expanders under certain algebraic conditions. Here is…
A graph polynomial $P$ is weakly distinguishing if for almost all finite graphs $G$ there is a finite graph $H$ that is not isomorphic to $G$ with $P(G)=P(H)$. It is weakly distinguishing on a graph property $\mathcal{C}$ if for almost all…
A simple Steinberg algebra associated to an ample Hausdorff groupoid $G$ is algebraically purely infinite if and only if the characteristic functions of compact open subsets of the unit space are infinite idempotents. If a simple Steinberg…