Hamilton cycles in sparse robustly expanding digraphs

Allan Lo, Viresh Patel

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)
60 Downloads (Pure)

Abstract

The notion of robust expansion has played a central role in the solution of several conjectures involving the packing of Hamilton cycles in graphs and directed graphs. These and other results usually rely on the fact that every robustly expanding (di)graph with suitably large minimum degree contains a Hamilton cycle. Previous proofs of this require Szemerédi’s Regularity Lemma and so this fact can only be applied to dense, sufficiently large robust expanders. We give a proof that does not use the Regularity Lemma and, indeed, we can apply our result to sparser robustly expanding digraphs.

Original languageEnglish
Article number#P3.44
JournalElectronic Journal of Combinatorics
Volume25
Issue number3
Publication statusPublished - 7 Sep 2018

Keywords

  • Digraph
  • Hamilton cycles
  • Robust expanders

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Hamilton cycles in sparse robustly expanding digraphs'. Together they form a unique fingerprint.

Cite this