activity
20242026
collaborators

7 papers

math.CO2026

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…

math.CO2026

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…

math.CO2025

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_…

math.CO2025

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…

math.CO2025

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…

math.CO2025

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…