Zequn Lv

activity

20212025

most citedExtremal results for graphs avoiding a rainbow subgraph

2 citations · 5 across the 15 of their papers we have counts for

collaborators

15 papers

math.CO2025

Edge pancyclic Cayley graphs on symmetric group

Mengyu Cao, Mei Lu, Zequn Lv +1

We study the derangement graph $Γ_{n}$ whose vertex set consists of all permutations of ${1, \dots, n}$ , where two vertices are adjacent if and only if their corresponding permutati…

math.CO2025

Sets avoiding a rainbow solution to the generalized Schur equation

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

A classical result in combinatorial number theory states that the largest subset of $[n]$ avoiding a solution to the equation $x + y = z$ is of size $⌈ n /2 ⌉$ . For all intege…

math.CO2024

Treewidth of generalized Hamming graph, bipartite Kneser graph and generalized Petersen graph

Yichen Wang, Mengyu Cao, Zequn Lv +1

Let $t, q$ and $n$ be positive integers. Write $[q] = {1, 2, \dots, q}$ . The generalized Hamming graph $H (t, q, n)$ is the graph whose vertex set is the cartesian product of $n$ copie…

math.CO2023

Hilton-Milner theorem for $k$ -multisets

Jiaqi Liao, Zequn Lv, Mengyu Cao +1

Let $k, n \in N^{+}$ and $m \in N^{+} \cup {\infty}$ . A $k$ -multiset in $[n]_{m}$ is a $k$ -set whose elements are integers from ${1, 2, \dots, n}$ , an…

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

The maximum number of cliques in graphs with bounded odd circumference

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

In this work, we give the sharp upper bound for the number of cliques in graphs with bounded odd circumferences. This generalized Turán-type result is an extension of the celebrate…

math.CO2022★ 1 cited

Edges not covered by monochromatic bipartite graphs

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

Let $f_{k} (n, H)$ denote the maximum number of edges not contained in any monochromatic copy of~ $H$ in a $k$ -coloring of the edges of $K_{n}$ , and let $e x (n, H)$ denote the Turán number…

math.CO2022

Generalized Turan number for the edge blow-up graph

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

Let $H$ be a graph and $p$ be an integer. The edge blow-up $H^{p}$ of $H$ is the graph obtained from replacing each edge in $H$ by a copy of $K_{p}$ where the new vertices of the cliqu…

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…

math.CO2022

The maximum number of copies of an even cycle in a planar graph

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

We resolve a conjecture of Cox and Martin by determining asymptotically for every $k \geq 2$ the maximum number of copies of $C_{2 k}$ in an $n$ -vertex planar graph.

math.CO2022★ 2 cited

Extremal results for graphs avoiding a rainbow subgraph

Peter Frankl, Ervin Győri, Zhen He +5

We say that $k$ graphs $G_{1}, G_{2}, \dots, G_{k}$ on a common vertex set of size $n$ contain a rainbow copy of a graph $H$ if their union contains a copy of $H$ with each edge belonging t…

math.CO2021

Rainbow Independent Sets in Cycles

Zequn Lv, Mei Lu

For a given class $C$ of graphs and given integers $m \leq n$ , let $f_{C} (n, m)$ be the minimal number $k$ such that every $k$ independent $n$ -sets in any graph belonging…

math.CO2021

Treewidth of the $q$ -Kneser graphs

Mengyu Cao, Ke Liu, Mei Lu +1

Let $V$ be an $n$ -dimensional vector space over a finite field $F_{q}$ , where $q$ is a prime power. Define the \emph{generalized $q$ -Kneser graph} $K_{q} (n, k, t)$ to be the gra…

Edge pancyclic Cayley graphs on symmetric group

Sets avoiding a rainbow solution to the generalized Schur equation

Treewidth of generalized Hamming graph, bipartite Kneser graph and generalized Petersen graph

Hilton-Milner theorem for k-multisets

Erdős-Ko-Rado Theorem for Bounded Multisets

The maximum number of cliques in graphs with bounded odd circumference

Edges not covered by monochromatic bipartite graphs

Generalized Turan number for the edge blow-up graph

Exact results for generalized extremal problems forbidding an even cycle

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

Edge pancyclic derangement graphs

The maximum number of copies of an even cycle in a planar graph

Extremal results for graphs avoiding a rainbow subgraph

Rainbow Independent Sets in Cycles

Treewidth of the q-Kneser graphs

Hilton-Milner theorem for $k$ -multisets

Treewidth of the $q$ -Kneser graphs