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 2022Show all

3 papers · 1 filter

math.CO2022★ 1 cited

Non-degenerate Hypergraphs with Exponentially Many Extremal Constructions

József Balogh, Felix Christian Clemen, Haoran Luo

For every integer $t \geq 0$ , denote by $F_{5}^{t}$ the hypergraph on vertex set ${1, 2, \dots, 5 + t}$ with hyperedges ${123, 124} \cup {34 k : 5 \leq k \leq 5 + t}$ . We determine $\mathr…

math.CO2022

Maximal 3-wise Intersecting Families with Minimum Size: the Odd Case

József Balogh, Ce Chen, Haoran Luo

A family $F$ on ground set ${1, 2, \dots, n}$ is maximal $k$ -wise intersecting if every collection of $k$ sets in $F$ has non-empty intersection, and no other…

math.CO2022

On the Maximum $F_{5}$ -free Subhypergraphs of a Random Hypergraph

Igor Araujo, József Balogh, Haoran Luo

Denote by $F_{5}$ the $3$ -uniform hypergraph on vertex set ${1, 2, 3, 4, 5}$ with hyperedges ${123, 124, 345}$ . Balogh, Butterfield, Hu, and Lenz proved that if $p > K lo g n / n$ for…

Non-degenerate Hypergraphs with Exponentially Many Extremal Constructions

Maximal 3-wise Intersecting Families with Minimum Size: the Odd Case

On the Maximum F5​-free Subhypergraphs of a Random Hypergraph

On the Maximum $F_{5}$ -free Subhypergraphs of a Random Hypergraph