activity
20232026
collaborators

13 papers

math.CO2026

Colored Turán densities and finite directed templates

Nannan Chen, Ander Lamaison, Heng Li +1

Classical Turán theory relates the asymptotic extremal problem for an ordinary forbidden graph to its chromatic number. This principle fails when a forbidden copy must respect pres…

math.CO2026

Solution of uniform Turán's Tetrahedron Problem

Bartłomiej Kielak, Daniel Král, Ander Lamaison +3

Turán's Tetrahedron Problem asks to determine the Turán density of the complete hypergraph (tetrahedron). This problem, posed by Turán in 1941, is one of the most famou…

math.CO2026

Upper-shadow comparisons on the slice and the Frankl--Tokushige product conjectures

Fan Chang, Hong Liu, Miao Liu

Let , and let be the family of all -sets containing a member of . Writing $μ_k(\mathcal{F})=|\…

math.CO2026

A Higher-Order Clique Density Theorem

Heng Li, Hong Liu, Yixiao Zhang

Reiher's clique density theorem determines the sharp lower envelope for the density of at fixed edge density. We prove a higher-order version in which the prescribed quantity…

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.CO2026

The sharp diagonal spectral correlation inequality on the discrete cube

Fan Chang, Hong Liu, Miao Liu

We prove the sharp diagonal spectral correlation conjecture of Friedgut, Kahn, Kalai and Keller, proposed in their Fourier-analytic approach to Chvátal's conjecture. For every pair…

math.CO2026

A sharp -biased product bound for -cross-intersecting families

Fan Chang, Hong Liu, Miao Liu

We prove a sharp product theorem for -cross-intersecting families in the -biased measure. If , , and $\mathcal{F}_1,\dots,\mathcal{F}_r\subset…

math.CO2026

A dichotomy for hypergraph Zarankiewicz problems on axis-parallel boxes

Ting-Wei Chao, Zichao Dong, Hong Liu +2

We study the Zarankiewicz problem for -partite, -uniform intersection hypergraphs arising from families of axis-parallel boxes in with prescribed direction…

math.CO2026

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…

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…

math.CO2024

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…

math.CO2024

Subgraphs of random graphs in hereditary families

Alexander Clifton, Hong Liu, Letícia Mattos +1

For a graph and a hereditary property , let denote the maximum number of edges of a subgraph of that belongs to . We pr…

math.CO2023

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…