Upper bounds on positional Paris-Harrington games

DOI10.1016/j.disc.2020.112257zbMath1457.91110OpenAlexW3117186543MaRDI QIDQ2222955

Massimo Lauria, Lorenzo Carlucci

Publication date: 27 January 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2020.112257

zbMATH Keywords

combinatorial gamesRamsey theorempositional gamesParis-Harrington theorem

Mathematics Subject Classification ID

Ramsey theory (05D10) Positional games (pursuit and evasion, etc.) (91A24) Combinatorial games (91A46)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new upper bound for diagonal Ramsey numbers
• Ramsey-Paris-Harrington numbers for graphs
• Van der Waerden and Ramsey type games
• Proof theory. 2nd ed
• Some bounds for the Ramsey-Paris-Harrington numbers
• Rapidly growing Ramsey functions
• Ramsey games
• Automata, logics, and infinite games. A guide to current research
• On Ramsey-type positional games
• Hypergraph Ramsey numbers
• Accessible Independence Results for Peano Arithmetic
• An Unprovable Ramsey-Type Theorem
• Graph Ramsey games
• A Winning Strategy for the Ramsey Graph Game
• Combinatorial Games
• Partition relations for cardinal numbers
• Some remarks on the theory of graphs

This page was built for publication: Upper bounds on positional Paris-Harrington games