Hamilton cycles in sparse robustly expanding digraphs
| Authors |
|
|---|---|
| Publication date | 07-09-2018 |
| Journal | Electronic Journal of Combinatorics |
| Article number | P3.44 |
| Volume | Issue number | 25 | 3 |
| Number of pages | 22 |
| Organisations |
|
| 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. |
| Document type | Article |
| Language | English |
| Published at | https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i3p44 |
| Other links | https://www.scopus.com/pages/publications/85053283512 |
| Downloads |
Hamilton cycles in sparse robustly expanding digraphs
(Final published version)
|
| Permalink to this page | |