Thresholds for the monochromatic clique transversal game

DOI10.1016/j.exmath.2022.11.001OpenAlexW4309880013MaRDI QIDQ2695001

Pakanun Dokyeesun, Sandi Klavžar, Csilla Bujtás

Publication date: 30 March 2023

Published in: Expositiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.03203

zbMATH Keywords

threshold biasclique-hypergraphmaker-breaker gameclique transversal game

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the domination number of grid graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Maker-Breaker domination game
• New approach to the \(k\)-independence number of a graph
• A new bound for the Maker-Breaker triangle game
• Maker-breaker total domination game
• List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly
• Positional games
• Hamiltonian Maker–Breaker Games on Small Graphs
• The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-independence number of graph products
• On a combinatorial game
• Colouring clique-hypergraphs of circulant graphs

This page was built for publication: Thresholds for the monochromatic clique transversal game