The following pages link to On Hajnal's triangle-free game (Q1187952):
Displaying 16 items.
- On the Chvàtal-Erdős triangle game (Q540061) (← links)
- Connected, bounded degree, triangle avoidance games (Q640454) (← links)
- An upper bound on the extremal version of Hajnal's triangle-free game (Q897581) (← links)
- On Erdős's Eulerian trail game (Q1300001) (← links)
- Intersecting designs from linear programming and graphs of diameter two (Q1322228) (← links)
- A connected version of the graph coloring game (Q2192130) (← links)
- Game saturation of intersecting families (Q2248514) (← links)
- Bounded degree, triangle avoidance graph games (Q2376102) (← links)
- Game matching number of graphs (Q2446826) (← links)
- On bichromatic triangle game (Q2448874) (← links)
- Maximal triangle‐free graphs with restrictions on the degrees (Q4277984) (← links)
- On maximal triangle‐free graphs (Q4309986) (← links)
- Connected graph game (Q4807478) (← links)
- Impartial hypergraph games (Q6046219) (← links)
- Path Saturation Game on Six Vertices (Q6489356) (← links)
- The constructor-blocker game (Q6567845) (← links)