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

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

Type: Article

Publication Date: 2006-01-19

Citations: 12

DOI: https://doi.org/10.1016/j.jctb.2005.12.002

View Publication

Locations

Journal of Combinatorial Theory Series B - View
CiteSeer X (The Pennsylvania State University) - View - PDF

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Large Holes in Quasi-Random Graphs	2008	Joanna Polcyn
+ PDF Chat	Short paths in 3-uniform quasi-random hypergraphs	2004	Joanna Polcyn
+ PDF Chat	Embedding tetrahedra into quasirandom hypergraphs	2016	Christian Reiher Vojtěch Rödl Mathias Schacht
+	Sparse Quasi-Random Graphs	2002	Fan Chung Ronald L. Graham
+	Quasirandom Multitype Graphs	2010	Joel Spencer
+	An Algorithmic Version of the Hypergraph Regularity Method	2008	Penny Haxell Brendan Nagle V. Rödl
+	Quasi-Random Graphs	2022	Yusheng Li Qizhong Lin
+	Quasi-random hypergraphs	2018
+	Cycles in random graphs and hypergraphs	1992	V. F. Kolchin
+ PDF Chat	Hereditary quasi-random properties of hypergraphs	2009	Domingos Dellamonica Vojtěch Rödl
+	Loose Hamilton Cycles in Random 3-Uniform Hypergraphs	2010	Alan Frieze
+ PDF Chat	Hamilton cycles in quasirandom hypergraphs	2016	John Lenz Dhruv Mubayi Richard Mycroft
+	Tight Hamilton cycles in cherry quasirandom $3$-uniform hypergraphs	2017	Elad Aigner Horev Gil Levy
+	Quasi-random graphs	1989	Fan Chung Ronald Graham R. Wilson
+ PDF Chat	Loose Hamilton Cycles in Random 3-Uniform Hypergraphs	2010	Andrzej Dudek Alan Frieze
+ PDF Chat	Non-linear Hamilton cycles in linear quasi-random hypergraphs	2021	Jie Han Xichao Shu Guanghui Wang
+	Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links	2021	Sören Berger Simón Piga Christian Reiher Vojtěch Rödl Mathias Schacht
+ PDF Chat	Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs	2019	Hiệp Hàn Jie Han Patrick Morris
+	Light spanners and sparse pseudo-random graphs	2003	Papa A. Sissokho Michelangelo Grigni Vojtěch Rödl
+ PDF Chat	Quasi-random hypergraphs	1989	Fan Chung Ronald Graham

Works That Cite This (10)

Action	Title	Year	Authors
+	Almost partitioning 2-coloured complete 3-uniform hypergraphs into two monochromatic tight or loose cycles	2017	Sebastián Bustamante Hiệp Hàn Maya Stein
+ PDF Chat	The Ramsey Number for 3-Uniform Tight Hypergraph Cycles	2009	Penny Haxell Tomasz Łuczak Yuejian Peng V. Rödl Andrzej Ruciński Jozef Skokan
+	The Ramsey number for hypergraph cycles I	2005	Penny Haxell Tomasz Łuczak Yuejian Peng V. Rödl Andrzej Ruciński Miklós Simonovits Jozef Skokan
+	Embeddings and Ramsey numbers of sparse k-uniform hypergraphs	2006	Oliver Cooley Nikolaos Fountoulakis Daniela Kühn Deryk Osthus
+	Decompositions into Subgraphs of Small Diameter	2010	Jacob Fox Benny Sudakov
+	Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles	2018	Sebastián Bustamante Hiệp Hàn Maya Stein
+	Short paths in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si7.gif" display="inline" overflow="scroll"><mml:mi>ε</mml:mi></mml:math>-regular pairs and small diameter decompositions of dense graphs	2009	Joanna Polcyn Andrzej Ruciński
+	Decompositions into subgraphs of small diameter	2009	Jacob Fox Benny Sudakov
+	Small Ramsey Numbers	2011	Stanisław Radziszowski
+	Embeddings and Ramsey numbers of sparse κ-uniform hypergraphs	2009	Oliver Cooley Nikolaos Fountoulakis Daniela Kühn Deryk Osthus

Works Cited by This (10)

Action	Title	Year	Authors
+ PDF Chat	Short paths in 3-uniform quasi-random hypergraphs	2004	Joanna Polcyn
+	A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph	1995	Richard A. Duke Hanno Lefmann V. Rödl
+	Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree	2006	Daniela Kühn Deryk Osthus
+	Blow-up Lemma	1997	János Komlós Gábor N. Sárközy Endre Szemerédi
+	Extremal problems on set systems	2002	Péter Frankl Vojtěch Rödl
+	A Dirac-Type Theorem for 3-Uniform Hypergraphs	2006	Vojtěch Rödl Andrzej Ruciński Endre Szemerédi
+	REGULAR PARTITIONS OF GRAPHS	1975	Endre Szemerédi
+	The Ramsey number for hypergraph cycles I	2005	Penny Haxell Tomasz Łuczak Yuejian Peng V. Rödl Andrzej Ruciński Miklós Simonovits Jozef Skokan
+	The Blow-up Lemma	1999	János Komlós
+	Extremal problems on set systems	2002	Péter Frankl Vojtěch Rödl