Short paths in quasi-random triple systems with sparse underlying graphs

DOI10.1016/j.jctb.2005.12.002zbMath1091.05009OpenAlexW2146592359MaRDI QIDQ2496208

Joanna Polcyn, Endre Szemerédi, Vojtěch Rödl, Andrzej Ruciński

Publication date: 12 July 2006

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2005.12.002

zbMATH Keywords

regularity lemmahypergraphsquasi-random structure

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Paths and cycles (05C38) Triple systems (05B07)

Related Items

The Ramsey Number for 3-Uniform Tight Hypergraph Cycles, Decompositions into Subgraphs of Small Diameter, Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs, Short paths in \(\varepsilon \)-regular pairs and small diameter decompositions of dense graphs

Cites Work

• Unnamed Item
• The Ramsey number for hypergraph cycles. I.
• Blow-up lemma
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Extremal problems on set systems
• Short paths in 3-uniform quasi-random hypergraphs
• A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph