The combinatorial game \textsc{Nofil} played on Steiner triple systems

DOI10.1002/JCD.21809MaRDI QIDQ6562275zbMATH OpenFDO

Authors Melissa Huggan, Svenja Huntemann, Brett Stevens

Publication date 26 June 2024

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

zbMATH Keywords

computational complexitygraph embeddingSteiner triple systemscombinatorial game theory

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Triple systems (05B07)

Recommendations

• Avoidance game on Steiner triple systems
• Combinatorial game distributions of Steiner systems
• On the complexity of the misère version of three games played on graphs
• Playing Nim on a simplicial complex
• Games on triangulations

Cites work

• scientific article; zbMATH DE number 3948279 (Why is no real title available?)
• scientific article; zbMATH DE number 512922 (Why is no real title available?)
• scientific article; zbMATH DE number 1559537 (Why is no real title available?)
• scientific article; zbMATH DE number 1775383 (Why is no real title available?)
• scientific article; zbMATH DE number 894528 (Why is no real title available?)
• scientific article; zbMATH DE number 3384054 (Why is no real title available?)
• scientific article; zbMATH DE number 3020856 (Why is no real title available?)
• Almost All Steiner Triple Systems Are Asymmetric
• Combinatorial game theory
• Compound Node-Kayles on paths
• Cops and robbers on graphs based on designs
• Edge-decompositions of graphs with high minimum degree
• Exact algorithms for Kayles
• Hardness vs randomness
• Kayles and Nimbers
• Lessons in play. An introduction to combinatorial game theory
• Nim, a game with a complete mathematical theory.
• On the complexity of approximating the independent set problem
• On the complexity of some two-person perfect-information games
• Playing games with algorithms: algorithmic combinatorial game theory
• Projective geometry. An introduction
• The CRC handbook of combinatorial designs
• The localization number of designs
• Tic-tac-toe on a finite plane
• Über zwei Abarten von Nim.

Describes a project that uses

This page was built for publication: The combinatorial game \textsc{Nofil} played on Steiner triple systems

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