The Extremal Number of Tight Cycles

DOI10.1093/imrn/rnaa396zbMath1492.05070arXiv2009.00528OpenAlexW3127300960MaRDI QIDQ5088633

István Tomon, Benjamin Sudakov

Publication date: 13 July 2022

Published in: International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.00528

zbMATH Keywords

line-graphrobust expanders

Mathematics Subject Classification ID

Hypergraphs (05C65) Enumeration in graph theory (05C30) Expander graphs (05C48)

Related Items (6)

Hypergraphs with no tight cycles ⋮ Uniform Turán density of cycles ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ On the Turán number of the hypercube ⋮ Rainbow subdivisions of cliques ⋮ Rainbow Turán number of clique subdivisions

This page was built for publication: The Extremal Number of Tight Cycles