Economical extremal hypergraphs for the Erdős-Selfridge theorem
DOI10.1016/J.DISC.2016.03.021zbMATH Open1338.05182OpenAlexW2421248299MaRDI QIDQ297937FDOQ297937
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
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
- scientific article; zbMATH DE number 3470458
- scientific article; zbMATH DE number 736300
- 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
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)
Cites Work
- Remarks on positional games. I
- Combinatorial Games
- On a combinatorial game
- A characterization on \(n\)-critical economical generalized tic-tac-toe games
- Extremal hypergraphs for the biased Erdős-Selfridge theorem
- Inevitable randomness in discrete mathematics
- Economical tight examples for the biased Erdős-Selfridge theorem
Cited In (4)
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)
