Zequn Lv

most citedEdges not covered by monochromatic bipartite graphs

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

collaborators

5 papers

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.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…

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

Rainbow Independent Sets in Cycles

Treewidth of the q-Kneser graphs

Treewidth of the $q$ -Kneser graphs