3 papers
math.CO2026
A One-Third Bound for the Maker--Breaker Degree Game
Kaizhe Chen, Xiaonan Chen, Haotian Yang
Let \(H\) be a finite hypergraph with rank and minimum degree \(d\). In the Maker--Breaker degree game, Maker and Breaker alternately claim previously unclaimed hyperedges of \…
math.CO2026
Tree suspensions and transfer functions for single degree Turán spectra
Jiangdong Ai, Laihao Ding, Hong Liu +1
For integers , let denote the single-forbidden -degree Turán spectrum of -uniform hypergraphs. We introduce transfer functions for this spectrum: e…
math.CO2024
Separating hypergraph Turán densities
Hong Liu, Bjarne Schülke, Shuaichao Wang +2
Determining the Turán densities of hypergraphs is a notoriously difficult problem at the core of combinatorics. Although Turán posed this problem in 1941, remai…