4 papers
math.CO2026
On the generalized Turán number of the complete bipartite graph
Jing Wang, Zixuan Yang, Junpeng Zhou
For graphs and , let denote the maximum number of copies of in an -vertex -free graph. Very recently, Janzer, Longbrake, and Yepremyan proved…
math.CO2026
Most probably trangle-free graphs
Yuhang Bai, Gyula O. H. Katona, Zixuan Yang
The celebrated Mantel's theorem states that any triangle-free graph on vertices contains at most edges. It is natural to ask how many triangle…
math.CO2026
The Turán number of Berge matchings
Yichen Wang, Zixuan Yang, Xiamiao Zhao +2
Given a graph , an -uniform hypergraph is a {\em Berge-} if there is a bijection such that for each $e\in E(F)…
math.CO2025
On saturation problems for matchings with regularity constraints
Gang Yang, Zixuan Yang, Shenggui Zhang
A graph is -saturated if is -free but for any edge in the complement of the graph contains . Gerbner et al. (Discrete Math., 345 (2022), 112921) in…