Zequn Lv

most citedStability version of Dirac's theorem and its applications for generalized Turán problems

1 citations · 2 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2023

Erdős-Ko-Rado Theorem for Bounded Multisets

Jiaqi Liao, Zequn Lv, Mengyu Cao +1

Let $k, m, n$ be positive integers with $k \geq 2$ . A $k$ -multiset of $[n]_{m}$ is a collection of $k$ integers from the set ${1, 2, \dots, n}$ in which the integers c…

math.CO2022

Exact results for generalized extremal problems forbidding an even cycle

Ervin Győri, Zhen He, Zequn Lv +4

We determine the maximum number of copies of $K_{s, s}$ in a $C_{2 s + 2}$ -free $n$ -vertex graph for all integers $s \geq 2$ and sufficiently large $n$ . Moreover, for $s \in {2, 3}$ and…

math.CO2022★ 1 cited

Stability version of Dirac's theorem and its applications for generalized Turán problems

Xiutao Zhu, Ervin Győri, Zhen He +3

In 1952, Dirac proved that every $2$ -connected $n$ -vertex graph with the minimum degree $k + 1$ contains a cycle of length at least $min {n, 2 (k + 1)}$ . Here we obtain a stability ve…

math.CO2022★ 1 cited

Edge pancyclic derangement graphs

Zequn Lv, Mengyu Cao, Mei Lu

We consider the derangement graph in which the vertices are permutations of ${1, \dots, n}$ . Two vertices are joined by an edge if the corresponding permutations differ in every…