The threshold bias of the clique-factor game

DOI10.1016/j.jctb.2021.10.001zbMath1478.05096arXiv2002.02578OpenAlexW3205667189MaRDI QIDQ2664555

Anita Liebenau, Rajko Nenadov

Publication date: 17 November 2021

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

positional gamesmaker-breakerclique-factor

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

Maker-Breaker Games on Randomly Perturbed Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the KŁR conjecture in random graphs
• Hypergraph containers
• Bandwidth theorem for random graphs
• Packings of graphs and applications to computational complexity
• On \(K^ 4\)-free subgraphs of random graphs
• A condition for matchability in hypergraphs
• Thresholds versus fractional expectation-thresholds
• Positional games
• Asymptotic random graph intuition for the biased connectivity game
• The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
• Generating random graphs in biased Maker-Breaker games
• Factors in random graphs
• Local resilience of graphs
• Remarks on positional games. I
• Biased Positional Games
• Triangle Factors in Random Graphs
• Positional Games
• Triangle‐factors in pseudorandom graphs
• Independent sets in hypergraphs
• Embedding large graphs into a random graph
• On a combinatorial game
• Biased positional games for which random strategies are nearly optimal

This page was built for publication: The threshold bias of the clique-factor game