Poset positional games

DOI10.1016/J.DISC.2025.114455MaRDI QIDQ6998708zbMATH OpenFDO

Authors Guillaume Bagan, E. Duchêne, Florian Galliot, Valentin Gledel, Mirjana Mikalački, Nacim Oijid, Aline Parreau, Miloš Stojaković

Publication date 11 April 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114455

zbMATH Keywords

complexitygraphhypergraphmaker-breakerposetpositional games

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Continuous lattices and posets, applications (06B35) Combinatorial games (91A46)

Cites work

• 6-uniform Maker-Breaker game is PSPACE-complete
• \((k-2)\)-linear connected components in hypergraphs of rank \(k\)
• Combinatorial Games
• scientific article; zbMATH DE number 988829 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• On a combinatorial game
• On the complexity of some two-person perfect-information games
• Positional games
• Reducibility among combinatorial problems
• Regularity and Positional Games

This page was built for publication: Poset positional games

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