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

3 papers · 1 filter

math.CO2024

On the thresholds of degenerate hypergraphs

Yu Chen, Jie Han, Haoran Luo

An $n$ -vertex $k$ -uniform hypergraph $G$ is $(d, α)$ -degenerate if $m_{1} (G) \leq d$ and there exists a constant $ε > 0$ such that for every subset $U \subseteq V (G)$ with siz…

math.CO2024

On the maximum $F$ -free induced subgraphs in $K_{t}$ -free graphs

József Balogh, Ce Chen, Haoran Luo

For graphs $F$ and $H$ , let $f_{F, H} (n)$ be the minimum possible size of a maximum $F$ -free induced subgraph in an $n$ -vertex $H$ -free graph. This notion generalizes the Ramsey fun…

math.CO2024

On the maximum number of $r$ -cliques in graphs free of complete $r$ -partite subgraphs

József Balogh, Suyun Jiang, Haoran Luo

We estimate the maximum possible number of cliques of size $r$ in an $n$ -vertex graph free of a fixed complete $r$ -partite graph $K_{s_{1}, s_{2}, \dots, s_{r}}$ . By viewing every $r$ -c…

On the thresholds of degenerate hypergraphs

On the maximum F-free induced subgraphs in Kt​-free graphs

On the maximum number of r-cliques in graphs free of complete r-partite subgraphs

On the maximum $F$ -free induced subgraphs in $K_{t}$ -free graphs

On the maximum number of $r$ -cliques in graphs free of complete $r$ -partite subgraphs