Fast embedding of spanning trees in biased Maker-Breaker games (Q2857367): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
label / enlabel / en
 
Fast embedding of spanning trees in biased Maker-Breaker games
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1010.2857 / rank
 
Normal rank
Property / arXiv classification
 
math.CO
Property / arXiv classification: math.CO / 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: 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
links / mardi / namelinks / mardi / name
 

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

    Identifiers