Hamilton cycles in graphs and hypergraphs: An extremal perspective

Research output: Chapter in Book/Report/Conference proceedingConference contribution

30 Citations (Scopus)

Abstract

As one of the most fundamental and well-known NP-complete problems, the Hamilton cycle problem has been the subject of intensive research. Recent developments in the area have highlighted the crucial role played by the notions of expansion and quasi-randomness. These concepts and other recent techniques have led to the solution of several long-standing problems in the area. New aspects have also emerged, such as resilience, robustness and the study of Hamilton cycles in hypergraphs. We survey these developments and highlight open problems, with an emphasis on extremal and probabilistic approaches.

Original languageEnglish
Title of host publicationInvited Lectures
EditorsSun Young Jang, Young Rock Kim, Dae-Woong Lee, Ikkwon Yie, Young Rock Kim, Dae-Woong Lee, Ikkwon Yie
PublisherKYUNG MOON SA Co. Ltd.
Pages381-406
Number of pages26
ISBN (Electronic)9788961058070
Publication statusPublished - 2014
Event2014 International Congress of Mathematicans, ICM 2014 - Seoul, Korea, Republic of
Duration: 13 Aug 201421 Aug 2014

Publication series

NameProceeding of the International Congress of Mathematicans, ICM 2014
Volume4

Conference

Conference2014 International Congress of Mathematicans, ICM 2014
Country/TerritoryKorea, Republic of
CitySeoul
Period13/08/1421/08/14

Bibliographical note

Publisher Copyright:
© 2014 by Seoul ICM 2014 Organizing Committee. All rights reserved.

Keywords

  • Factorizations
  • Graph packings and coverings
  • Hamilton cycles
  • Hamilton decompositions
  • Hypergraphs

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint

Dive into the research topics of 'Hamilton cycles in graphs and hypergraphs: An extremal perspective'. Together they form a unique fingerprint.

Cite this