Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2506.15582

Is it easy to regularize a hypergraph with easy links?

Lior Gishboliner·Asaf Shapira·Yuval Wigderson
View original source ↗Read source document ↗Export metadata ↓

Abstract

A partition of a (hyper)graph is $\varepsilon$-homogenous if the edge densities between almost all clusters are either at most $\varepsilon$ or at least $1-\varepsilon$. Suppose a $3$-graph has the property that the link of every vertex has an $\varepsilon$-homogenous partition of size $\text{poly}(1/\varepsilon)$. Does this guarantee that the $3$-graph also has a small homogenous partition? Terry and Wolf proved that such a $3$-graph has an $\varepsilon$-homogenous partition of size given by a wowzer-type function. Terry recently improved this to a double exponential bound, and conjectured that this bound is tight. Our first result in this paper disproves this conjecture by giving an improved (single) exponential bound, which is best possible. We further obtain an analogous result for $k$-graphs of all uniformities $k \geq 3$. The above problem is part of a much broader programme which seeks to understand the conditions under which a (hyper)graph has small $\varepsilon$-regular partitions. While this problem is fairly well understood for graphs, the situation is (as always) much more involved already for $3$-graphs. For example, it is natural to ask if one can strengthen our first result by only requiring each link to have $\varepsilon$-regular partitions of size $\text{poly}(1/\varepsilon)$. Our second result shows that surprisingly the answer is `no', namely, a $3$-graph might only have regular partitions of tower-type size, even though the link of every vertex has an $\varepsilon$-regular partition of polynomial size.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lior Gishboliner, Asaf Shapira, Yuval Wigderson. 2026-02-10. Is it easy to regularize a hypergraph with easy links?. https://arxiv.org/abs/2506.15582

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗