Size Ramsey Number of Bounded Degree Graphs for Games

DOI10.1017/S0963548313000151zbMath1269.05075OpenAlexW2071075508MaRDI QIDQ2841487

Heidi Gebauer

Publication date: 26 July 2013

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548313000151

zbMATH Keywords

Maker/Breaker games

Mathematics Subject Classification ID

Games involving graphs (91A43) Generalized Ramsey theory (05C55) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Sparse partition universal graphs for graphs of bounded degree
• The Ramsey number of a graph with bounded maximum degree
• Two remarks on the Burr-Erdős conjecture
• Van der Waerden and Ramsey type games
• Expanding graphs contain all small trees
• The size Ramsey number
• On graphs which contain all small trees
• Sparse universal graphs
• Perfect Storage Representations for Families of Data Structures
• Winning Fast in Sparse Graph Construction Games
• Universal Graphs for Bounded-Degree Trees and Planar Graphs
• Deterministic Graph Games and a Probabilistic Intuition
• On size Ramsey number of paths, trees, and circuits. I
• The Induced Size-Ramsey Number of Cycles
• Sparse universal graphs for bounded‐degree graphs
• On size Ramsey numbers of graphs with bounded degree

This page was built for publication: Size Ramsey Number of Bounded Degree Graphs for Games