Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets
From MaRDI portal
Publication:6172311
DOI10.1016/j.disc.2023.113576zbMath1518.05137arXiv2007.15141OpenAlexW3207802005MaRDI QIDQ6172311
Eric Lars Sundberg, Ramin Naimi
Publication date: 19 July 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.15141
2-person games (91A05) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a covering problem in the hypercube
- Highly symmetric subgraphs of hypercubes
- An extremal theorem in the hypercube
- Bounding the size of square-free subgraphs of the hypercube
- Some Turán type results on the hypercube
- Subcube fault-tolerance in hypercubes
- Polychromatic colorings on the hypercube
- Linear polychromatic colorings of hypercube faces
- Linear \(d\)-polychromatic \(Q_{d-1}\)-colorings of the hypercube
- Positional games
- A note on short cycles in a hypercube
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
- On the Complexity of Chooser–Picker Positional Games
- Hexagon-free subgraphs of hypercubes
- A Ramsey-type result for the hypercube
- On 14-Cycle-Free Subgraphs of the Hypercube
- Polychromatic Colorings of Subcubes of the Hypercube
- Subgraphs of a hypercube containing no small even cycles
- On the maximum number of edges in a c4‐free subgraph of qn
- Combinatorial Games
- Turán’s Theorem in the Hypercube
- On even-cycle-free subgraphs of the hypercube
- On a combinatorial game
This page was built for publication: Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets
