Power of \(k\) choices in the semi-random graph process

DOI10.37236/11909arXiv2302.13330OpenAlexW4391258576MaRDI QIDQ6117415

Paweł Prałat, Harjas Singh

Publication date: 19 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Hamiltonian cycleperfect matchingsemi-random graph process

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Eulerian and Hamiltonian graphs (05C45) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Maximum matchings in a class of random graphs
• Tight bounds on probabilistic zero forcing on hypercubes and grids
• Corrigendum to: ``Existence of a perfect matching in a random \((1+e^{-1})\)-out bipartite graph
• Hamilton cycles in the semi-random graph process
• Balanced allocations (extended abstract)
• Introduction to Random Graphs
• Hamilton cycles in 3-out
• Balls and bins: A study in negative dependence
• Semi‐random graph process
• Very fast construction of bounded-degree spanning graphs via the semi-random graph process
• Perfect Matchings in the Semirandom Graph Process

This page was built for publication: Power of \(k\) choices in the semi-random graph process