On the square of a Hamiltonian cycle in dense graphs

Random Structures and Algorithms

Volumn 9, Issue 1, 1996, Pages 193-211

  Komlós, János ^a,c   Sárközy, Gábor N ^b   Szemerédi, Endre ^a,c  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c Academy of Natural Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21444443593     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199608/09)9:1/2<193::AID-RSA12>3.0.CO;2-P     Document Type: Article

References (22)

1. B. Bollobás, External Graph Theory, Academic Press, London, 1978.
2. K. Corrádi and A. Hajnal, On the maximal number of independent circuits in a graph, Acta Math. Acad. Sci. Hung., 14, 423-439 (1963).
3. G. A. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc. 2, 68-81 (1952).
4. P. Erdos, Problem 9, in Theory of Graphs and Its Applications, M. Fieldler, Ed., Czech. Acad. Sci. Publ., Prague, 1964, p. 159.
5. G. Fan and R. Häggkvist, The square of a hamiltonian cycle, SIAM J. Discrete Math., to appear.
6. G. Fan and H. A. Kierstead, The square of paths and cycles, preprint.
7. G. Fan and H. A. Kierstead, The square of paths and cycles, J. Combinat. Theor. Ser. B, 63, 55-64 (1995).
8. G. Fan and H. A. Kierstead, Hamiltonian square-paths, preprint.
9. G. Fan and H. A. Kierstead, Partitioning a graph into two square-cycles, preprint.
10. R. J. Faudree, R. J. Gould, and M. Jacobson, On a problem of Pósa and Seymour, preprint.
11. R. J. Faudree, R. J. Gould, M. S. Jacobson, and R. H. Schelp, On a problem of Paul Seymour, in Recent Advances in Graph Theory, V. R. Kulli, Ed., Vishwa International Publication, 1991, pp. 197-215.
12. R. Häggkvist, On F-hamiltonian graphs, in Graph Theory and Related Topics, J. A. Bondy and U. S. R. Murty, Eds., Academic Press, New York, 1979, pp. 219-231.
13. A. Hajnal and E. Szemerédi, Proof of a conjecture of Erdos, in Combinatorial Theory and Its Applications Vol. II, P. Erdos, A. Rényi and V. T Sós Eds., Colloq. Math. Soc. J. Bolyai 4, North-Holland, Amsterdam, 1970, pp. 601-623.
14. J. Komlós, G. N. Sárközy, and E. Szemerédi, Proof of a packing conjecture of Bollobás, AMS Conference on Discrete Mathematics, DeKalb, II, 1993, Combinatorics, Probability and Computing 4, 241-255 (1995).
15. J. Komlós, G. N. Sárközy, and E. Szemerédi, Proof of a packing conjecture of Bollobás, AMS Conference on Discrete Mathematics, DeKalb, II, 1993, Combinatorics, Probability and Computing 4, 241-255 (1995).
16. J. Komlós, G. N. Sárközy, and E. Szemerédi, On the Pósa-Seymour conjecture, J. Graph Theor., to appear.
17. J. Komlós, G. N. Sárközy, and E. Szemerédi, The blow-up lemma, Combinatorica, to appear.
18. L. Lovász, Combinatorial Problems and Exercises, Akadémiai Kiadó, Budapest, 1979.
19. L. Pósa, Hamiltonian circuits in random graphs. Discrete Math., 14, 359-364 (1976).
20. P. Seymour, Problem section, in Combinatorics: Proceedings of the British Combinatorial Conference 1973, T. P. McDonough and V. C. Mavron, Eds., Cambridge University Press, 1974, pp. 201-202.
21. E. Szemerédi, Regular partitions of graphs, Colloques Internationaux C.N.R.S. No 260 - Problèmes Combinatoires et Théorie des Graphes, Orsay, 1976, pp. 399-401.
22. E. Szemerédi, On a set containing no k elements in arithmetic progression, Acta Arithmet., XXVII, 199-245 (1975).