Rainbow matchings in Dirac bipartite graphs
From MaRDI portal
Publication:5242877
DOI10.1002/rsa.20835zbMath1426.05137arXiv1711.02916OpenAlexW2962779929WikidataQ128579424 ScholiaQ128579424MaRDI QIDQ5242877
Guillem Perarnau, Matthew Coulson
Publication date: 7 November 2019
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.02916
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) Transversal (matching) theory (05D15) Vertex degrees (05C07)
Related Items (11)
The \(n\)-queens completion problem ⋮ Graph Tilings in Incompatibility Systems ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ A Dirac-type theorem for Berge cycles in random hypergraphs ⋮ A rainbow blow‐up lemma ⋮ Rainbow structures in locally bounded colorings of graphs ⋮ A Rainbow Dirac's Theorem ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ Decompositions into isomorphic rainbow spanning trees ⋮ Rainbow factors in hypergraphs ⋮ Berge cycles in non-uniform hypergraphs
This page was built for publication: Rainbow matchings in Dirac bipartite graphs
