6 papers
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 \…
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…
Vanishing orders, suspensions and zero degree Turán densities
Jiangdong Ai, Laihao Ding, Hong Liu +1
For integers , the -degree Turán density measures the minimum -degree threshold that forces a copy of a fixed -uniform hypergraph , gener…
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…
On -graphs with vanishing codegree Turán density
Laihao Ding, Ander Lamaison, Hong Liu +2
For a -uniform hypergraph (or simply -graph) , the codegree Turán density is the supremum over all such that there exist arbitrarily large -ver…
Vanishing codegree Turán density implies vanishing uniform Turán density
Laihao Ding, Hong Liu, Shuaichao Wang +1
For a -uniform hypergraph (or simply -graph) , the codegree Turán density is the infimum over all such that any -vertex -graph with ever…