Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree

DOI10.1016/j.endm.2017.06.039zbMath1378.05049OpenAlexW2743499480MaRDI QIDQ1689912

Oriol Serra, Guillem Perarnau, Pilar Cano

Publication date: 18 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.06.039

zbMATH Keywords

probabilistic methodrainbow subgraphsswitching techniques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (5)

Properly colored Hamilton cycles in Dirac-type hypergraphs ⋮ A rainbow blow‐up lemma ⋮ A Rainbow Dirac's Theorem ⋮ Rainbow vertex-pancyclicity of strongly edge-colored graphs ⋮ Rainbow Hamiltonian cycles in strongly edge-colored graphs

Cites Work

• Unnamed Item
• Rainbow Hamilton cycles in uniform hypergraphs
• Lopsided Lovász Local lemma and Latin transversals
• Edge disjoint placement of graphs
• Using Lovász local lemma in the space of random injections
• On rainbow trees and cycles
• Packings of graphs and applications to computational complexity
• Multicoloured Hamilton cycles
• Properly coloured copies and rainbow copies of large graphs with small maximum degree
• Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
• Properly colored and rainbow copies of graphs with few cherries

This page was built for publication: Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree