Winning Fast in Sparse Graph Construction Games (Q3608334): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Ohad Noy Feldheim / rank | |||
Property / author | |||
Property / author: Ohad Noy Feldheim / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
links / mardi / name | links / mardi / name | ||
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
4 March 2009
0 references
maker-breaker game
0 references
complete graph
0 references
lower bound
0 references
number of rounds
0 references
0 references