Showing 2024Show all
3 papers · 1 filter
math.CO2024
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…
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 -vertex graph with positive edge density contains a `rich' vertex subset of size su…
math.CO2024
On the maximum number of -cliques in graphs free of complete -partite subgraphs
József Balogh, Suyun Jiang, Haoran Luo
We estimate the maximum possible number of cliques of size in an -vertex graph free of a fixed complete -partite graph . By viewing every -c…