7 papers
Hypergraph ErdÅs--Rogers functions with consecutive clique sizes
Qizhong Lin, Lin Niu
For integers \(k\le s<t\), the hypergraph ErdÅs--Rogers function \(f^{(k)}_{s,t}(n)\) is the largest integer \(m\) such that every \(n\)-vertex \(K_t^{(k)}\)-free \(k\)-graph cont…
A step towards the Ramsey-Turán conjecture for and
Xinyu Hu, Qizhong Lin
Ramsey-Turán type problems were initiated by ErdÅs and Sós in 1969. Given integers , a graph is -free if there exists a red/blue edge coloring of su…
Asymptotically optimal Ramsey goodness of sparse graphs versus odd cycles and paths
Chunchao Fan, Qizhong Lin
A fundamental problem in graph Ramsey theory is to determine, for sparse graphs on vertices, the minimal such that is Ramsey-good for odd cycles and paths $P_…
Ramsey numbers of long even cycles versus books
Qizhong Lin, Shixi Song
For any positive integers and , let be the book graph consisting of copies of the complete graph sharing a common . Let be a cycle of le…
The Ramsey number of the 4-cycle versus a book graph
Chunyang Dou, Tianyu Li, Qizhong Lin +1
Given positive integers and , the book graph consists of copies of sharing a common . The book graph is a common generalization of a star and…
Phase transitions of the ErdÅs-Gyárfás function
Xinyu Hu, Qizhong Lin, Xin Lu +1
Given positive integers . For any integer , an edge coloring of the complete -graph is said to be a -coloring if every copy of receive…