Hong Liu

activity

20242026

collaborators

5 papers

math.CO2026

Chromatic thresholds for pairs of graphs

Jun Gao, Hong Liu, Zhuo Wu +1

The chromatic threshold of a graph $H$ is the minimum-degree density above which every $H$ -free graph has bounded chromatic number. We study a two-color Ramsey analogue: for graphs…

math.CO2025

Set families: restricted distances via restricted intersections

Zichao Dong, Jun Gao, Hong Liu +2

Denote by $f_{D} (n)$ the maximum size of a set family $F$ on $[n] \stackrel{\mbox{\normalfont\tiny def}}{=} \{1, \dots, n\}$ with distance set $D$ . That is, $|A \bigtriangl…

math.CO2025

Bipartite TurÃ¡n problems via graph gluing

Zichao Dong, Jun Gao, Hong Liu

For graphs $H_{1}$ and $H_{2}$ , if we glue them by identifying a given pair of vertices $u \in V (H_{1})$ and $v \in V (H_{2})$ , what is the extremal number of the resulting graph $H_1^u \od…

math.CO2025

Induced rational exponents and bipartite subgraphs in $K_{s, s}$ -free graphs

Zichao Dong, Jun Gao, Ruonan Li +1

In this paper, we study a general phenomenon that many extremal results for bipartite graphs can be transferred to the induced setting when the host graph is $K_{s, s}$ -free. As ma…

math.CO2024

Induced even cycles in locally sparse graphs

Laihao Ding, Jun Gao, Hong Liu +2

A graph $G$ is $(c, t)$ -sparse if for every pair of vertex subsets $A, B \subset V (G)$ with $∣ A ∣, ∣ B ∣ \geq t$ , $e (A, B) \leq (1 - c) ∣ A ∣∣ B ∣$ . In this paper we prove that for every $c > 0$ and…

Chromatic thresholds for pairs of graphs

Set families: restricted distances via restricted intersections

Bipartite TurÃ¡n problems via graph gluing

Induced rational exponents and bipartite subgraphs in Ks,s​-free graphs

Induced even cycles in locally sparse graphs

Induced rational exponents and bipartite subgraphs in $K_{s, s}$ -free graphs