On a rainbow version of Dirac's theorem

DOI10.1112/blms.12343zbMath1444.05078arXiv1910.01281OpenAlexW3027399113MaRDI QIDQ3300090

Felix Joos, Jae-Hoon Kim

Publication date: 27 July 2020

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

perfect matchings

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (13)

Transversals and bipancyclicity in bipartite graph families ⋮ Rainbow Perfect Matchings for 4-Uniform Hypergraphs ⋮ Co-degree threshold for rainbow perfect matchings in uniform hypergraphs ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ Spectral radius and rainbow matchings of graphs ⋮ Rainbow structures in a collection of graphs with degree conditions ⋮ On a rainbow extremal problem for color‐critical graphs ⋮ A general approach to transversal versions of Dirac‐type theorems ⋮ Concentration of rainbow \(k\)-connectivity of a multiplex random graph ⋮ Rainbow pancyclicity in graph systems ⋮ On the rainbow matching conjecture for 3-uniform hypergraphs ⋮ From one to many rainbow Hamiltonian cycles ⋮ Transversal factors and spanning trees

Cites Work

• A topological colorful Helly theorem
• Points surrounding the origin
• A generalization of Caratheodory's theorem
• Transversals in row-latin rectangles
• Density of Gallai multigraphs
• Rainbow matchings in \(r\)-partite \(r\)-graphs
• Large rainbow matchings in general graphs
• Perfect matchings in \(r\)-partite \(r\)-graphs
• A rainbow version of Mantel's Theorem
• A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem
• Some Theorems on Abstract Graphs

This page was built for publication: On a rainbow version of Dirac's theorem