Component games on random graphs

DOI10.1007/S00493-022-5036-9MaRDI QIDQ6969983zbMATH OpenFDO

Authors Rani Hod, Michael Krivelevich, Tobias Müller, Alon Naor, Nicholas Wormald

Publication date 19 June 2025

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00493-022-5036-9

zbMATH Keywords

binomial random graph

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 747040 (Why is no real title available?)
• A Solution of the Shannon Switching Game
• A critical point for random graphs with a given degree sequence
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• A simple solution to the k‐core problem
• Asymptotic random graph intuition for the biased connectivity game
• Biased Positional Games
• Biased games on random boards
• Biased positional games and the phase transition
• Combinatorial Games
• Component games on regular graphs
• Doubly biased maker-breaker connectivity game
• Edge-Disjoint Spanning Trees of Finite Graphs
• Encores on cores
• Global maker-breaker games on sparse graphs
• Introduction to Random Graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• On the threshold for k-regular subgraphs of random graphs
• Positional games
• Positional games on random graphs
• Size and connectivity of the \(k\)-core of a random graph
• Sudden emergence of a giant k-core in a random graph
• The diameter of sparse random graphs
• The solution space geometry of random linear equations
• Thek-Core and Branching Processes

This page was built for publication: Component games on random graphs

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