4 papers
math.CO2025
On the number of triangles in -free graphs
Jialin He, Jie Ma, Yan Wang +1
Erdős asked whether for any -vertex graph , the parameter is at most , where the minimum is taken over all edge…
math.CO2023
Optimal bisections of directed graphs
Guanwu Liu, Jie Ma, Chunlei Zu
In this paper, motivated by a problem of Scott and a conjecture of Lee, Loh and Sudakov we consider bisections of directed graphs. We prove that every directed graph with arcs…
math.CO2021
Towards a conjecture of Birmelé-Bondy-Reed on the Erdős-Pósa property of long cycles
Jie Ma, Chunlei Zu
A conjecture of Birmelé, Bondy and Reed states that for any integer , every graph without two vertex-disjoint cycles of length at least contains a set of at…
math.CO2020
A generalization of Stiebitz-type results on graph decomposition
Qinghou Zeng, Chunlei Zu
In this paper, we consider the decomposition of multigraphs under minimum degree constraints and give a unified generalization of several results by various researchers. Let be…