Hyper-regular graphs and high dimensional expanders

Abstract

Let G= (V,E) be a finite graph. For d0>0 we say that G is d0-regular, if every v∈ V has degree d0. We say that G is (d0, d1)-regular, for 0<d1<d0, if G is d0 regular and for every v∈ V, the subgraph induced on v's neighbors is d1-regular. Similarly, G is (d0, d1,…, dn-1)-regular for 0<dn-1<…<d1<d0, if G is d0 regular and for every 1≤ i≤ n-1, the joint neighborhood of every clique of size i is di-regular; In that case, we say that G is an n-dimensional hyper-regular graph (HRG). Here we define a new kind of graph product, through which we build examples of infinite families of n-dimensional HRG such that the joint neighborhood of every clique of size at most n-1 is connected. In particular, relying on the work of Kaufman and Oppenheim, our product yields an infinite family of n-dimensional HRG for arbitrarily large n with good expansion properties. This answers a question of Dinur regarding the existence of such objects.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…