Leilei Zhang

collaborators

3 papers

math.CO2022

Graphs with many independent vertex cuts

Yanan Hu, Xingzhi Zhan, Leilei Zhang

The cycles are the only $2$ -connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k \geq 3$ there exist…

math.CO2022

The maximum number of $K_{r_{1}, \dots, r_{s}}$ in graphs with a given circumference or matching number

Leilei Zhang

Let $K_{r_{1}, \dots, r_{s}}$ denote the complete multipartite graph with class sizes $r_{1}, \dots, r_{s}$ and let $K_{s}$ denote the complete graph of order $s$ . In 2018, Luo determined the…

math.CO2021

The maximum size of a nonhamiltonian graph with given order and connectivity

Xingzhi Zhan, Leilei Zhang

Motivated by work of Erdős, Ota determined the maximum size $g (n, k)$ of a $k$ -connected nonhamiltonian graph of order $n$ in 1995. But for some pairs $n, k,$ the maximum size is not…

Graphs with many independent vertex cuts

The maximum number of Kr1​,…,rs​​ in graphs with a given circumference or matching number

The maximum size of a nonhamiltonian graph with given order and connectivity

The maximum number of $K_{r_{1}, \dots, r_{s}}$ in graphs with a given circumference or matching number