The Kőnig graph process

DOI10.1002/rsa.20969zbMath1454.05112arXiv1906.04806OpenAlexW3003849163MaRDI QIDQ3386537

Natasha Morrison, Nina Kamčev, Michael Krivelevich, Benjamin Sudakov

Publication date: 5 January 2021

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

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

zbMATH Keywords

matchingrandom processrandom graphperfect matchingvertex cover

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)

The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hoeffding's inequality for supermartingales
• On the connectivity threshold of Achlioptas processes
• Freedman's inequality for matrix martingales
• The early evolution of the \(H\)-free process
• Lower bounds for the size of random maximal \(H\)-free graphs
• The triangle-free process
• On large matchings and cycles in sparse random graphs
• Avoiding a giant component
• Introduction to Random Graphs
• Hamiltonicity thresholds in Achlioptas processes
• On the Random Satisfiable Process
• Random Graph Processes with Degree Restrictions
• The random k‐matching‐free process
• On the size of a random maximal graph
• The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
• Dynamic concentration of the triangle-free process
• The random planar graph process
• On the existence of a factor of degree one of a connected random graph
• Concentration of Measure for the Analysis of Randomized Algorithms

This page was built for publication: The Kőnig graph process