On the square of a Hamiltonian cycle in dense graphs

János Komlós, Gábor N. Sárközy, E. Szemerédi

Research output: Contribution to journalArticle

40 Citations (Scopus)

Abstract

In 1962 Pósa conjectured that any graph G of order n and minimum degree at least 2/3n contains the square of a Hamiltonian cycle. In this paper we prove this conjecture for sufficiently large n.

Original languageEnglish
Pages (from-to)193-211
Number of pages19
JournalRandom Structures and Algorithms
Volume9
Issue number1
Publication statusPublished - Aug 1996

Fingerprint

Hamiltonians
Hamiltonian circuit
Minimum Degree
Graph in graph theory

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Mathematics(all)
  • Applied Mathematics

Cite this

On the square of a Hamiltonian cycle in dense graphs. / Komlós, János; Sárközy, Gábor N.; Szemerédi, E.

In: Random Structures and Algorithms, Vol. 9, No. 1, 08.1996, p. 193-211.

Research output: Contribution to journalArticle

Komlós, János ; Sárközy, Gábor N. ; Szemerédi, E. / On the square of a Hamiltonian cycle in dense graphs. In: Random Structures and Algorithms. 1996 ; Vol. 9, No. 1. pp. 193-211.
@article{005e0bfd9e0849a5a44bce176704d8e5,
title = "On the square of a Hamiltonian cycle in dense graphs",
abstract = "In 1962 P{\'o}sa conjectured that any graph G of order n and minimum degree at least 2/3n contains the square of a Hamiltonian cycle. In this paper we prove this conjecture for sufficiently large n.",
author = "J{\'a}nos Koml{\'o}s and S{\'a}rk{\"o}zy, {G{\'a}bor N.} and E. Szemer{\'e}di",
year = "1996",
month = "8",
language = "English",
volume = "9",
pages = "193--211",
journal = "Random Structures and Algorithms",
issn = "1042-9832",
publisher = "John Wiley and Sons Ltd",
number = "1",

}

TY - JOUR

T1 - On the square of a Hamiltonian cycle in dense graphs

AU - Komlós, János

AU - Sárközy, Gábor N.

AU - Szemerédi, E.

PY - 1996/8

Y1 - 1996/8

N2 - In 1962 Pósa conjectured that any graph G of order n and minimum degree at least 2/3n contains the square of a Hamiltonian cycle. In this paper we prove this conjecture for sufficiently large n.

AB - In 1962 Pósa conjectured that any graph G of order n and minimum degree at least 2/3n contains the square of a Hamiltonian cycle. In this paper we prove this conjecture for sufficiently large n.

UR - http://www.scopus.com/inward/record.url?scp=21444443593&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=21444443593&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:21444443593

VL - 9

SP - 193

EP - 211

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

SN - 1042-9832

IS - 1

ER -