paper

Regularity method for hypergraphs with -cycle-free links

arXiv:2608.24740

Abstract

We extend the hypergraph regularity method to sparse -uniform hypergraphs whose vertex links are -free. In other words, we consider hypergraphs that are -free, which implies that . For such hypergraphs we establish a sparse analogue of the removal lemma for the tight cycle on seven vertices minus an edge.

34 pages

Regularity method for hypergraphs with $4$-cycle-free links · wovepaper