Haoran Luo

activity

20202026

most citedOn the number of forests and connected spanning subgraphs

2 citations · 4 across the 16 of their papers we have counts for

collaborators

Showing 2026Show all

5 papers · 1 filter

math.CO2026

The number of sum-free subsets of lattice cubes

Haoran Luo

A subset of the $d$ -dimensional lattice cube $[n]^{d}$ is sum-free if it contains no solution to the equation $x + y = z$ . We study the total number of such subsets. For $d = 1$ , Cameron a…

math.CO2026

On the minimum size of maximal $k$ -wise intersecting families

Haoran Luo

A family $F$ of subsets of $[n] := {1, 2, \dots, n}$ is called maximal $k$ -wise intersecting if every collection of at most $k$ members of $F$ has a non-empty…

math.CO2026

Local maximum of inducibility profiles

József Balogh, Bernard Lidický, Haoran Luo

For a graph $G$ and $e \in [0, 1]$ , denote by $I_{G} (e)$ the supremum of induced density of $G$ over $n$ -vertex graphs with edge density $e$ as $n$ goes to infinity. Liu, Mubayi and Re…

math.CO2026

On the maximum density of $r$ -graphs in which every $(r + 1)$ -set spans $0$ or $2$ edges

Vishesh Jain, Haoran Luo, Dhruv Mubayi

In 1984, Frankl and Füredi asked for the maximum density of an $n$ -vertex $r$ -graph in which every $(r + 1)$ -set of vertices spans $0$ or $2$ edges. They gave a construction with asy…

math.CO2026

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 $C_{ℓ}^{r}$ , the $r$ -uniform hypergraph tight cycle of length $ℓ$ . A result of Han, Lo, and Sanhueza-Matamala states that if $\el…

The number of sum-free subsets of lattice cubes

On the minimum size of maximal k-wise intersecting families

Local maximum of inducibility profiles

On the maximum density of r-graphs in which every (r+1)-set spans 0 or 2 edges

A Jump in the Codegree Turán Densities of Long Tight Cycles

On the minimum size of maximal $k$ -wise intersecting families

On the maximum density of $r$ -graphs in which every $(r + 1)$ -set spans $0$ or $2$ edges