Suyun Jiang

activity

20242026

collaborators

Showing 2024 · math.COShow all

3 papers · 2 filters

math.CO2024

Generalized Ramsey--Turán density for cliques

Jun Gao, Suyun Jiang, Hong Liu +1

We study the generalized Ramsey--Turán function $RT (n, K_{s}, K_{t}, o (n))$ , which is the maximum possible number of copies of $K_{s}$ in an $n$ -vertex $K_{t}$ -free graph with indepe…

math.CO2024

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 $n$ -vertex graph $G$ with positive edge density contains a `rich' vertex subset $U$ of size $n^{1 - o (1)}$ su…

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…

Generalized Ramsey--Turán density for cliques

Graph with any rational density and no rich subsets of linear size

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

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