1 citations · 1 across the 8 of their papers we have counts for
8 papers
Chromatic thresholds for pairs of graphs
Jun Gao, Hong Liu, Zhuo Wu +1
The chromatic threshold of a graph is the minimum-degree density above which every -free graph has bounded chromatic number. We study a two-color Ramsey analogue: for graphs…
Induced rational exponents and bipartite subgraphs in -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 -free. As ma…
Set families: restricted distances via restricted intersections
Zichao Dong, Jun Gao, Hong Liu +2
Denote by the maximum size of a set family on with distance set . That is, holds for every pair of di…
Bipartite Turán problems via graph gluing
Zichao Dong, Jun Gao, Hong Liu
For graphs and , if we glue them by identifying a given pair of vertices and , what is the extremal number of the resulting graph $H_1^u \od…
Induced even cycles in locally sparse graphs
Laihao Ding, Jun Gao, Hong Liu +2
A graph is -sparse if for every pair of vertex subsets with , . In this paper we prove that for every and…
Sidorenko's conjecture for subdivisions and theta substitutions
Seonghyuk Im, Ruonan Li, Hong Liu
The famous Sidorenko's conjecture asserts that for every bipartite graph , the number of homomorphisms from to a graph with given edge density is minimized when is p…
Generalized Ramsey--Turán density for cliques
Jun Gao, Suyun Jiang, Hong Liu +1
We study the generalized Ramsey--Turán function , which is the maximum possible number of copies of in an -vertex -free graph with indepe…
Graph with any rational density and no rich subsets of linear size
Seonghyuk Im, Suyun Jiang, Hong Liu +1
A well-known application of the dependent random choice asserts that any -vertex graph with positive edge density contains a `rich' vertex subset of size su…