Extremal hypergraphs for the Erdős-Selfridge theorem using labelings of binary trees (Q6650629)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Extremal hypergraphs for the Erdős-Selfridge theorem using labelings of binary trees |
scientific article; zbMATH DE number 7955818
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extremal hypergraphs for the Erdős-Selfridge theorem using labelings of binary trees |
scientific article; zbMATH DE number 7955818 |
Statements
Extremal hypergraphs for the Erdős-Selfridge theorem using labelings of binary trees (English)
0 references
9 December 2024
0 references
positional games
0 references
generalized tic-tac-toe
0 references
maker-breaker games
0 references
