We survey some recent results on long-standing conjectures regarding Hamilton cycles in directed graphs, oriented graphs and tournaments. We also combine some of these to prove the following approximate result towards Kelly's conjecture on Hamilton decompositions of regular tournaments: the edges of every regular tournament can be covered by a set of Hamilton cycles which are 'almost' edge-disjoint. We also highlight the role that the notion of 'robust expansion' plays in several of the proofs. New and old open problems are discussed. (C) 2011 Elsevier Ltd. All rights reserved.
机构:
Tel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Sch Math Sci, IL-6997801 Tel Aviv, IsraelTel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Sch Math Sci, IL-6997801 Tel Aviv, Israel
Krivelevich, Michael
Lee, Choongbum
论文数: 0引用数: 0
h-index: 0
机构:
MIT, Dept Math, Cambridge, MA 02139 USATel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Sch Math Sci, IL-6997801 Tel Aviv, Israel
Lee, Choongbum
Sudakov, Benny
论文数: 0引用数: 0
h-index: 0
机构:
ETH, Dept Math, CH-8092 Zurich, SwitzerlandTel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Sch Math Sci, IL-6997801 Tel Aviv, Israel