Unified threatening-structure framework for rank-three Maker–Breaker games

Develop a unified view of the threatening-structure technique for 3-uniform hypergraphs, with the aim of obtaining improved algorithms for Maker–Breaker games on hypergraphs of rank at most three.

Background

The paper's analysis exploits vertices of degree four as forcing or threatening structures in the unbiased claw game, in a manner analogous to the use of copies of K4 in the unbiased triangle game. The authors ask whether these game-specific ideas can be subsumed under a common framework for 3-uniform hypergraphs.

A successful unification could improve algorithms for Maker–Breaker games on hypergraphs of rank at most three, beyond the techniques used for the claw and triangle games separately.

References

Is there a unified view of this technique applicable to 3-uniform hypergraphs? Such a result could lead to an improved algorithm for the Maker-Breaker game on hypergraphs with rank at most three.

— A Linear-Time Algorithm for the Unbiased Claw Game on Graphs with Maximum Degree 4  (2610.21878 - Brinkmann, 15 Oct 2026) in Section 6, Open Problems and Future Work