From the 1 of 4 linked papers with an AI index.
4 papers
Hypergraph Turan with bounded matching number
Yue Xu, Jiasheng Zeng, Xiao-Dong Zhang
The paper determines the exact maximum number of edges in 3‑uniform and 4‑uniform Berge‑K₃‑free hypergraphs whose matching number is bounded by s, providing precise Turán numbers a…
Polylogarithmic Bounds for Nested Cycles without Geometric Crossings
Yue Xu, Jiasheng Zeng, Xiao-Dong Zhang
A problem of ErdÅs asks for extremal conditions forcing edge-disjoint cycles with a prescribed nested structure. In the geometric version, the nesting is required to be noncrossin…
Generalized Turan number with given size
Yan Wang, Yue Xu, Jiasheng Zeng +1
Generalized Turán problem with given size, denoted as , determines the maximum number of -copies in an -free graph with edges. We prove that for…
Dense halves in balanced 2-partition of K4-free graphs
Yue Xu, Xiao-Dong Zhang
A balanced 2-partition of a graph is a bipartition of such that . Balogh, Clemen, and Lidický conjectured that for every -free graph on (even) v…