Random perfect matchings in regular graphs

DOI10.1002/rsa.21172zbMath1529.05130arXiv2301.10131OpenAlexW4384133444MaRDI QIDQ6144573

Bertille Granet, Felix Joos

Publication date: 5 January 2024

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

perfect matchingsexpander graphsrandom matchings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Expander graphs (05C48)

Cites Work

• Random matchings in regular graphs
• Perfect matchings in \(\varepsilon\)-regular graphs
• Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
• The robust component structure of dense regular graphs and applications
• A blow-up lemma for approximate decompositions
• Cycle partitions of regular graphs
• Fractional cycle decompositions in hypergraphs

This page was built for publication: Random perfect matchings in regular graphs