Related papers: Remarks on partitions into expanders

We study large minors in small-set expanders. More precisely, we consider graphs with $n$ vertices and the property that every set of size at most $\alpha n / t$ expands by a factor of $t$, for some (constant) $\alpha > 0$ and large $t =…

In this paper, the first of a series of two, we continue the study of higher index theory for expanders. We prove that if a sequence of graphs is an expander and the girth of the graphs tends to infinity, then the coarse Baum-Connes…

A graph is prime (with respect to the split decomposition) if its vertex set does not admit a partition (A,B) (called a split) with |A|, |B| >= 2 such that the set of edges joining A and B induces a complete bipartite graph. We prove that…

We study Gibbs partitions that typically form a unique giant component. The remainder is shown to converge in total variation toward a Boltzmann-distributed limit structure. We demon- strate how this setting encompasses arbitrary weighted…

We study infinite analogues of expander graphs, namely graphs where subgraphs weighted by heat kernels form an expander family. Our main result is that there does not exist any infinite expander in this sense. This proves the analogue for…

We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…

We show that families of coverings of an algebraic curve where the associated Cayley-Schreier graphs form an expander family exhibit strong forms of geometric (genus and gonality) growth. Combining this general result with finiteness…

We show that every locally sparse graph contains a linearly sized expanding subgraph. For constants $c_1>c_2>1$, $0<\alpha<1$, a graph $G$ on $n$ vertices is called a $(c_1,c_2,\alpha)$-graph if it has at least $c_1n$ edges, but every…

In this survey we aim to give a comprehensive overview of results using sublinear expanders. The term sublinear expanders refers to a variety of definitions of expanders, which typically are defined to be graphs $G$ such that every…

It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…

In this paper we study the algebra of graph invariants, focusing mainly on the invariants of simple graphs. All other invariants, such as sorted eigenvalues, degree sequences and canonical permutations, belong to this algebra. In fact,…

Symmetry breaking for graphs and other combinatorial objects is notoriously hard. On the one hand, complete symmetry breaks are exponential in size. On the other hand, current, state-of-the-art, partial symmetry breaks are often considered…

The Cayley graphs of finite groups are known to provide several examples of families of expanders, and some of them are Ramanujan graphs. Babai studied isospectral non-isomorphic Cayley graphs of the dihedral groups. Lubotzky, Samuels and…

This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…

We construct explicit generating sets S_n and \tilde S_n of the for the alternating and the symmetric groups, which turn the Cayley graphs C(Alt(n), S_n) and C(Sym(n), \tilde S_n) into a family of bounded degree expanders for all n. This…

In this paper, given a split extension of an arbitrary Coxeter group by automorphisms of the Coxeter graph, we determine the involutions in that extension whose centralizer has finite index. Our result has applications to many problems such…

We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath, Leighton and Rosenberg from 1992. The key to the proof is a new structural tool called layered partitions, and the result that every planar graph has…

Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split…

We prove that sparse string graphs in a fixed surface have linear expansion. We extend this result to the more general setting of sparse region intersection graphs over any proper minor-closed class. The proofs are combinatorial and…

We prove a coarse version of Halin's Grid Theorem: Every one-ended, locally finite graph that contains the disjoint union of infinitely many rays as an asymptotic minor also contains the half-grid as an asymptotic minor. More generally, we…