5 papers · 1 filter
Rainbow spanning structures in strongly edge-colored graphs
Laihao Ding, Xiaolan Hu, Suyun Jiang
An edge-colored graph is a graph in which each edge is assigned a color. Such a graph is called strongly edge-colored if each color class forms an induced matching, and called rain…
Property O and Erdős--Szekeres properties in linear hypergraphs
Suyun Jiang, Ander Lamaison, Minghui Ouyang
An oriented -uniform hypergraph, or oriented -graph, is said to satisfy Property O if, for every linear ordering of its vertex set, there is some edge oriented consistently w…
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…
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…