Ruilin Shi

Journal article Journal of the London Mathematical Society · December 1, 2025 Alon and Shikhelman initiated the systematic study of a generalization of the extremal function. Motivated by algorithmic applications, the study of the extremal function (Formula presented.), that is, the number of cliques of order (Formula presented.) in ... Full text Cite

Planar Turán number of the 7-cycle

Journal article European Journal of Combinatorics · May 1, 2025 The planar Turán number exP(n,H) of a graph H is the maximum number of edges in an n-vertex planar graph without H as a subgraph. Let Cℓ denote the cycle of length ℓ. The planar Turán number exP(n,Cℓ) is known wh ... Full text Cite

Dense circuit graphs and the planar Turán number of a cycle

Journal article Journal of Graph Theory · January 1, 2025 The planar Turán number (Formula presented.) of a graph (Formula presented.) is the maximum number of edges in an (Formula presented.) -vertex planar graph without (Formula presented.) as a subgraph. Let (Formula presented.) denote the cycle of length (For ... Full text Cite