Economical extremal hypergraphs for the Erdős-Selfridge theorem

DOI10.1016/J.DISC.2016.03.021zbMath1338.05182OpenAlexW2421248299MaRDI QIDQ297937

Eric Lars Sundberg, Emily A. Heath

Publication date: 20 June 2016

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

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

zbMATH Keywords

positional gamesgeneralized tic-tac-toemaker-breaker games

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Economical tight examples for the biased Erdős-Selfridge theorem
• A characterization on \(n\)-critical economical generalized tic-tac-toe games
• Extremal hypergraphs for the biased Erdős-Selfridge theorem
• Remarks on positional games. I
• Combinatorial Games
• On a combinatorial game

This page was built for publication: Economical extremal hypergraphs for the Erdős-Selfridge theorem