the.bay.news

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

arXiv.org
Regularity method for hypergraphs with $4$-cycle-free links
We extend the hypergraph regularity method to sparse $3$-uniform hypergraphs whose vertex links are $C_4$-free. In other words, we consider hypergraphs $H=(V,E)$ that are $K_{1,2,2}$-free, which implies that $|E|=O(|V|^{5/2})$. For such hypergraphs we establish a sparse analogue of the removal lemma for the tight cycle on seven vertices minus an edge.

0 comments

Sign in to join the discussion — your thebay.events account works here.

No comments yet.