Winning Fast in Sparse Graph Construction Games (Q3608334): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Winning Strategy for the Ramsey Graph Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Graph Games and a Probabilistic Intuition / rank
 
Normal rank

Latest revision as of 03:40, 29 June 2024

scientific article
Language Label Description Also known as
English
Winning Fast in Sparse Graph Construction Games
scientific article

    Statements

    Winning Fast in Sparse Graph Construction Games (English)
    0 references
    0 references
    0 references
    4 March 2009
    0 references
    0 references
    maker-breaker game
    0 references
    complete graph
    0 references
    lower bound
    0 references
    number of rounds
    0 references