Laihao Ding

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2026

Tree suspensions and transfer functions for single degree TurÃ¡n spectra

Jiangdong Ai, Laihao Ding, Hong Liu +1

For integers $1 \leq ℓ < k$ , let $I^_{ℓ}^{k}$ denote the single-forbidden $ℓ$ -degree TurÃ¡n spectrum of $k$ -uniform hypergraphs. We introduce transfer functions for this spectrum:…

math.CO2026

Vanishing orders, suspensions and zero degree TurÃ¡n densities

Jiangdong Ai, Laihao Ding, Hong Liu +1

For integers $1 \leq ℓ < k$ , the $ℓ$ -degree TurÃ¡n density $I ¨ _{ℓ} (F)$ measures the minimum $ℓ$ -degree threshold that forces a copy of a fixed $k$ -uniform hypergraph $F$ , gen…

math.CO2026

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…

math.CO2024

Induced even cycles in locally sparse graphs

Laihao Ding, Jun Gao, Hong Liu +2

A graph $G$ is $(c, t)$ -sparse if for every pair of vertex subsets $A, B \subset V (G)$ with $∣ A ∣, ∣ B ∣ \geq t$ , $e (A, B) \leq (1 - c) ∣ A ∣∣ B ∣$ . In this paper we prove that for every $c > 0$ and…

math.CO2024

On $3$ -graphs with vanishing codegree TurÃ¡n density

Laihao Ding, Ander Lamaison, Hong Liu +2

For a $k$ -uniform hypergraph (or simply $k$ -graph) $F$ , the codegree TurÃ¡n density $I ¨ _{co} (F)$ is the supremum over all $I^\pm$ such that there exist arbitrarily large $n$ -…

Tree suspensions and transfer functions for single degree TurÃ¡n spectra

Vanishing orders, suspensions and zero degree TurÃ¡n densities

Rainbow spanning structures in strongly edge-colored graphs

Induced even cycles in locally sparse graphs

On 3-graphs with vanishing codegree TurÃ¡n density

On $3$ -graphs with vanishing codegree TurÃ¡n density