A Rainbow Dirac's Theorem

DOI10.1137/18M1218881zbMath1450.05050arXiv1809.06392OpenAlexW3046120522MaRDI QIDQ5130574

Guillem Perarnau, Matthew Coulson

Publication date: 28 October 2020

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.06392

zbMATH Keywords

rainbowswitchingsHamilton cycleLovász local lemmaDirac graphslopsided Lovász local lemma

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (6)

Graph Tilings in Incompatibility Systems ⋮ Minimum degree ensuring that a hypergraph is Hamiltonian-connected ⋮ Properly colored Hamilton cycles in Dirac-type hypergraphs ⋮ Repeated Patterns in Proper Colorings ⋮ On Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ Rainbow pancyclicity in graph systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rainbow Hamilton cycles in uniform hypergraphs
• A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs
• Compatible Hamilton cycles in Dirac graphs
• Lopsided Lovász Local lemma and Latin transversals
• On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\)
• Hamiltonian degree sequences in digraphs
• Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
• Transversals of latin squares and their generalizations
• Proof of the Seymour conjecture for large graphs
• Blow-up lemma
• Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree
• Multicoloured Hamilton cycles
• Rainbow factors in hypergraphs
• Extensions of results on rainbow Hamilton cycles in uniform hypergraphs
• Bounded colorings of multipartite graphs and hypergraphs
• On Hamilton's ideals
• On Hamiltonian bipartite graphs
• Properly coloured copies and rainbow copies of large graphs with small maximum degree
• Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree
• Decompositions into spanning rainbow structures
• A rainbow blow‐up lemma
• Rainbow structures in locally bounded colorings of graphs
• Rainbow matchings in Dirac bipartite graphs
• Proof of the 1-factorization and Hamilton Decomposition Conjectures
• Robust Hamiltonicity of Dirac graphs
• Some Theorems on Abstract Graphs
• Properly colored and rainbow copies of graphs with few cherries

This page was built for publication: A Rainbow Dirac's Theorem