Showing 2024Show all
3 papers · 1 filter
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…