Fast embedding of spanning trees in biased maker-breaker games (Q427795): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Embedding nearly-spanning bounded degree trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on positional games. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Graph Games and a Probabilistic Intuition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Biased Positional Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biased Positional Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanding graphs contain all small trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic random graph intuition for the biased connectivity game / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solution to the Box Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast winning strategies in maker-breaker games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in highly connected and expanding graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp threshold for the appearance of certain spanning trees in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two problems regarding the Hamiltonian cycle game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanders Are Universal for the Class of All Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Spanning Trees in Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛 / rank
 
Normal rank

Revision as of 08:13, 5 July 2024

scientific article
Language Label Description Also known as
English
Fast embedding of spanning trees in biased maker-breaker games
scientific article

    Statements

    Fast embedding of spanning trees in biased maker-breaker games (English)
    0 references
    0 references
    0 references
    0 references
    18 June 2012
    0 references
    Maker-Baker, tree embedding game
    0 references
    complete graph
    0 references
    edge set
    0 references
    winning strategy
    0 references

    Identifiers