Subgraph games in the semi-random graph process and its generalization to hypergraphs

DOI10.37236/11859MaRDI QIDQ6614185

Paweł Prałat, Natalie C. Behague, Trent G. Marbach, Andrzej Ruciński

Publication date: 7 October 2024

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

zbMATH Keywords

graph processessingle-player game

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Hamilton cycles in the semi-random graph process
• 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
• Power of \(k\) choices in the semi-random graph process
• Sharp thresholds in adaptive random graph processes
• A fully adaptive strategy for Hamiltonian cycles in the semi-random graph process
• Semi-random process without replacement

This page was built for publication: Subgraph games in the semi-random graph process and its generalization to hypergraphs