Long paths and Hamiltonicity in random graphs

doi:10.1017/CBO9781316479988.002

1 - Long paths and Hamiltonicity in random graphs

Published online by Cambridge University Press: 05 May 2016

Michael Krivelevich ,

Konstantinos Panagiotou ,

Mathew Penrose and

Colin McDiarmid

Michael Krivelevich

Edited by

Nikolaos Fountoulakis and

Dan Hefetz

Show author details

Michael Krivelevich: Affiliation:
Tel-Aviv University
Konstantinos Panagiotou: Affiliation:
Universität Munchen
Mathew Penrose: Affiliation:
University of Bath
Colin McDiarmid: Affiliation:
University of Oxford
Nikolaos Fountoulakis: Affiliation:
University of Birmingham
Dan Hefetz: Affiliation:
University of Birmingham

Book contents

Get access

Summary

Introduction

Long paths and Hamiltonicity are certainly among the most central and researched topics of modern graph theory. It is thus only natural to expect that they will take a place of honor in the theory of random graphs. And indeed, the typical appearance of long paths and of Hamilton cycle is one of the most thoroughly studied directions in random graphs, with a great many diverse and beautiful results obtained over the past fifty or so years.

In this survey we aim to cover some of the most basic theorems about long paths and Hamilton cycles in the classical models of random graphs, such as the binomial random graph or the random graph process. By no means should this text be viewed as a comprehensive coverage of results of this type in various models of random graphs; the reader looking for breadth should rather consult research papers or a recent monograph on random graphs by Frieze and Karoński [1]. Instead, we focus on simplicity, aiming to provide accessible proofs of several classical results on the subject and showcasing the tools successfully applied recently to derive new and fairly simple proofs, such as applications of the Depth First Search (DFS) algorithm for finding long paths in random graphs and the notion of boosters.

Although this chapter is fairly self-contained mathematically, basic familiarity and hands-on experience with random graphs would certainly be of help for the prospective reader. The standard random graph theory monographs of Bollobás [2] and of Janson et al. [3] certainly provide (much more than) the desired background.

This chapter is based on a mini-course with the same name, delivered by the author at the LMS-EPSRC Summer School on Random Graphs, Geometry, and Asymptotic Structure, organized by Dan Hefetz and Nikolaos Fountoulakis at the University of Birmingham in the summer of 2013. The author would like to thank the course organizers for inviting him to deliver the mini-course, and for encouraging him to create lecture notes for the course, which eventually served as a basis for the present chapter.

Type: Chapter
Information: Random Graphs, Geometry and Asymptotic Structure , pp. 4 - 27

DOI: https://doi.org/10.1017/CBO9781316479988.002 [Opens in a new window]

Publisher: Cambridge University Press

Print publication year: 2016

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Book purchase

Temporarily unavailable

References

[1] A., Frieze and M., Karoński, Introduction to Random Graphs, Cambridge University Press, Cambridge, 2016.Google Scholar

[2] B., Bollobás, Random Graphs, 2nd edn., Cambridge University Press, Cambridge, 2001.Google Scholar

[3] S., Janson, T., Luczak, and A., Ruciński, Random Graphs, Wiley, New York, 2000.Google Scholar

[4] I., Ben-Eliezer, M., Krivelevich, and B., Sudakov, The size Ramsey number of a directed path, J. Comb. Theor. Ser. B 102 (2012), 743–755.Google Scholar

[5] L., Pósa, Hamiltonian circuits in random graphs, Discrete Math. 14 (1976), 359–364.Google Scholar

[6] P., Erdõs, and A., Rényi, On the evolution of random graphs, Publ. Math. Inst. Hungar. Acad. Sci. 5 (1960), 17–61.Google Scholar

[7] M., Ajtai, J., Komlós, and E., Szemerédi, The longest path in a random graph, Combinatorica 1 (1981), 1–12.Google Scholar

[8] M., Krivelevich and B., Sudakov, The phase transition in random graphs – a simple proof, Random Structures Algorithms 43 (2013), 131–138.Google Scholar

[9] R., Karp, The transitive closure of a random digraph, Random Structures Algorithms 1 (1990), 73–93.Google Scholar

[10] W. Fernandez de la, Vega, Long paths in random graphs, Studia Sci.Math. Hungar. 14 (1979), 335–340.Google Scholar

[11] J., Komlós and E., Szemerédi, Limit distributions for the existence of Hamilton circuits in a random graph, Discrete Math. 43 (1983), 55–63.Google Scholar

[12] B., Bollobás, The evolution of sparse graphs, Graph Theory and Combinatorics, Academic Press, London (1984), 35–57.Google Scholar

[13] M., Ajtai, J., Komlós, and E., Szemerédi, First occurrence of Hamilton cycles in random graphs, Cycles in graphs (Burnaby, B.C., 1982), North-Holland Mathematical Studies 115, North-Holland, Amsterdam (1985), 173–178.Google Scholar