Economical extremal hypergraphs for the Erdős-Selfridge theorem

DOI10.1016/J.DISC.2016.03.021MaRDI QIDQ297937zbMATHOpenAlexFDO

Authors Emily Heath, Eric Sundberg

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) Games on graphs (graph-theoretic aspects) (05C57) Hypergraphs (05C65) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Recommendations

• Extremal hypergraphs for the biased Erdős-Selfridge theorem
• Hypergraph extensions of the Erdős-Gallai theorem
• Hypergraph extensions of the Erdős-Gallai theorem
• Erdős-Hajnal-type theorems in hypergraphs
• Extremal hypergraphs for Ryser's conjecture
• Publication:4056041
• Publication:4326644
• On Erdős' extremal problem on matchings in hypergraphs
• An extension of the Erdős-Ginzburg-Ziv theorem to hypergraphs
• On an extremal hypergraph problem of Brown, Erdős and Sós

Cites work

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

Cited in

(4)

• Extremal hypergraphs for the biased Erdős-Selfridge theorem
• Extremal hypergraphs for the Erdős-Selfridge theorem using labelings of binary trees
• Economical tight examples for the biased Erdős-Selfridge theorem
• Irreducible economies and strongly connected graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q297937)