Creating subgraphs in semi-random hypergraph games

DOI10.37236/13447MaRDI QIDQ6864187zbMATH OpenFDO

Authors Natalie C. Behague, Paweł Prałat, Andrzej Ruciński

Publication date 4 February 2026

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

Full work available at URL https://doi.org/10.37236/13447

zbMATH Keywords

\(s\)-uniform hypergraphsemi-random graph process

Mathematics Subject Classification ID

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

Cites work

• A fully adaptive strategy for Hamiltonian cycles in the semi-random graph process
• Building Hamiltonian cycles in the semi-random graph process in less than 2n rounds
• Cliques, chromatic number, and independent sets in the semi-random process
• Hamilton cycles in the semi-random graph process
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Perfect matchings and loose Hamilton cycles in the semirandom hypergraph model
• Perfect matchings in the semirandom graph process
• Power of \(k\) choices in the semi-random graph process
• Semi-random graph process
• Semi-random process without replacement
• Sharp thresholds in adaptive random graph processes
• Subgraph games in the semi-random graph process and its generalization to hypergraphs
• Subhypergraphs in non-uniform random hypergraphs
• The semi-random tree process
• Very fast construction of bounded-degree spanning graphs via the semi-random graph process

This page was built for publication: Creating subgraphs in semi-random hypergraph games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864187)