8 papers
On the minimum size of maximal -wise intersecting families
Haoran Luo
A family of subsets of is called maximal -wise intersecting if every collection of at most members of has a non-empty…
Local maximum of inducibility profiles
József Balogh, Bernard Lidický, Haoran Luo
For a graph and , denote by the supremum of induced density of over -vertex graphs with edge density as goes to infinity. Liu, Mubayi and Re…
On the maximum density of -graphs in which every -set spans or edges
Vishesh Jain, Haoran Luo, Dhruv Mubayi
In 1984, Frankl and Füredi asked for the maximum density of an -vertex -graph in which every -set of vertices spans or edges. They gave a construction with as…
A Jump in the Codegree Turán Densities of Long Tight Cycles
József Balogh, Haoran Luo, Maya Sankar
We study the codegree Turán density of , the -uniform hypergraph tight cycle of length . A result of Han, Lo, and Sanhueza-Matamala states that if $\e…
Maximum number of points in general position in a random subset of finite -dimensional spaces
József Balogh, Haoran Luo
Let be the maximum possible size of a point set in general position in the -random subset of . In this note, we determine the order of m…
Multicolor ErdÅs--Rogers Functions
Hong Liu, Haoran Luo, Minghui Ouyang
In this paper, we study a multicolor variant of ErdÅs--Rogers functions. Let be the largest integer such that there is always an induce…