Fast embedding of spanning trees in biased Maker-Breaker games (Q2857367): Difference between revisions
From MaRDI portal
Changed label, description and/or aliases in en, and other parts |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Deterministic Graph Games and a Probabilistic Intuition / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Biased Positional Games / 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: Hamilton cycles in highly connected and expanding graphs / 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: The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛 / rank | |||
Normal rank |
Latest revision as of 23:43, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fast embedding of spanning trees in biased Maker-Breaker games |
scientific article |
Statements
1 November 2013
0 references
math.CO
0 references