9 papers
ErdÅs--Ko--Rado theorems in -norm for three finite spaces
Qian Bao, Yaojun Chen, Yanbo Zhang
Let be a -uniform hypergraph. The famous ErdÅs--Ko--Rado (1961) theorem determines the maximum size and extremal structure for being -intersectin…
A note on tree-cycle Ramsey numbers
Ting Huang, Yanbo Zhang, Yaojun Chen
Let denote the Ramsey number of a tree on vertices versus a cycle of length . Burr, ErdÅs, Faudree, Rousseau, and Schelp (1982) asked for the least…
Online Ramsey numbers of the claw versus cycles
Hexuan Zhi, Yanbo Zhang
The online Ramsey number is defined via a Builder--Painter game on an empty graph with countably many vertices. In each round, Builder reveals an edge, which Painte…
Trichotomy and -goodness of sparse graphs
Yanbo Zhang, Yaojun Chen
Let be a connected graph with vertices and edges and denote the disjoint union of complete graphs . In this paper, by developing a trichotomy for sp…
Ramsey goodness of stars and fans for the Hajós graph
Jiafu He, Haiyu Zeng, Yanbo Zhang
Given two graphs and , the Ramsey number denotes the smallest integer such that any red-blue coloring of the edges of contains either a red …
Fan-goodness of sparse graphs
Ting Huang, Yanbo Zhang, Yaojun Chen
Let be a connected graph of order , be a fan consisting of triangles sharing a common vertex, and be vertex-disjoint copies of . Brennan (2017) sho…