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

Journal of Combinatorial Theory. Series B

Volumn 96, Issue 4, 2006, Pages 584-607

  Polcyn, Joanna ^a   Rödl, Vojtech ^b   Ruciński, Andrzej ^a   Szemerédi, Endre ^c  

^a ADAM MICKIEWICZ UNIVERSITY   (Poland)

^b EMORY UNIVERSITY   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

Paths; Quasi randomness; Triple systems

Indexed keywords

EID: 33646768979     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2005.12.002     Document Type: Article

References (10)

1. Duke R., Lefmann H., and Rödl V. A fast approximation algorithm for computing the frequencies of subgraphs in a given graph. SIAM J. Comput. 24 3 (1995) 598-620
2. Frankl P., and Rödl V. Extremal problems on set systems. Random Structures Algorithms 20 (2002) 131-164
3. Haxell P., et al. The Ramsey number for hypergraph cycles I. J. Combin. Theory Ser. A 113 (2006) 67-83
4. P. Haxell, et al., The Ramsey number for hypergraph cycles II, submitted for publication
5. Komlós J., Sárközy G., and Szemerédi E. The blow-up lemma. Combinatorica 17 (1997) 109-123
6. D. Kühn, D. Osthus, Loose Hamilton cycles in 3-uniform hypergraphs of large minimum degree, submitted for publication
7. Polcyn J. Short paths in 3-uniform quasi-random hypergraphs. Discuss. Math. Graph Theory 24 (2004) 469-484
8. J. Polcyn, Holes and short paths in quasi-random pairs, in preparation
9. Rödl V., Ruciński A., and Szemerédi E. A Dirac-type theorem for 3-uniform hypergraphs. Combin. Probab. Comput. 15 1-2 (2006) 229-251
10. Szemerédi E. Regular partitions of graphs. Problemes combinatoires et theorie des graphes. Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976. Colloq. Internat. CNRS vol. 260 (1978), CNRS, Paris 399-401