6 papers · 1 filter
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…
Rainbow spanning structures in strongly edge-colored graphs
Laihao Ding, Xiaolan Hu, Suyun Jiang
An edge-colored graph is a graph in which each edge is assigned a color. Such a graph is called strongly edge-colored if each color class forms an induced matching, and called rain…
Induced even cycles in locally sparse graphs
Laihao Ding, Jun Gao, Hong Liu +2
A graph is -sparse if for every pair of vertex subsets with , . In this paper we prove that for every and…
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…