Note on matching preclusion number of random graphs

DOI10.1016/j.tcs.2019.12.011zbMath1453.05101OpenAlexW2996548529MaRDI QIDQ784472

Yaping Mao, Guoju Ye, Ran Gu

Publication date: 3 August 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.12.011

zbMATH Keywords

random graphperfect matchingmatching preclusion number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Conditional matching preclusion for regular bipartite graphs and their Cartesian product

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching preclusion and conditional matching preclusion for regular interconnection networks
• Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
• On two Hamilton cycle problems in random graphs
• On packing Hamilton cycles in \(\varepsilon\)-regular graphs
• Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
• Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
• Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
• Hamilton decompositions of regular expanders: applications
• On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs
• MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
• Paths in graphs
• Optimal Packings of Hamilton Cycles in Sparse Random Graphs
• Edge-disjoint Hamilton cycles in random graphs
• Matching preclusion for some interconnection networks

This page was built for publication: Note on matching preclusion number of random graphs