Zequn Lv
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Zequn Lv has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Mei Lu
Department of Mathematical Sciences, Tsinghua University, Beijing, China
7 shared publications - Xiutao Zhu
School of Mathematics Nanjing University of Aeronautics and Astronautics Nanjing China
7 shared publications - Zhen He
Department of Mathematical Sciences, Tsinghua University, Beijing, China
7 shared publications - Ervin Győri
HUN-REN Alfréd Rényi Institute of Mathematics 1053 Budapest Hungary
6 shared publications - Casey Tompkins
ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS BUDAPEST HUNGARY
3 shared publications - Nika Salia
ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS BUDAPEST HUNGARY
3 shared publications
Latest Publications
- 15 July 2024
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 159
Many triangles in C5-free graphs
- 15 July 2024
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 159
Many triangles in C5-free graphs
- 14 March 2024
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 206
Erdős-Ko-Rado theorem for bounded multisets
- 14 March 2024
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 206
Erdős-Ko-Rado theorem for bounded multisets
- Open Access
- 22 February 2024
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 167, 15-22
The maximum number of copies of an even cycle in a planar graph
- 22 February 2024
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 167, 15-22
Open AccessThe maximum number of copies of an even cycle in a planar graph
- Open Access
- 24 January 2024
- Published by Springer Nature in Annals of Combinatorics
- Vol. 28 (4) , 1119-1125
The Maximum Number of Cliques in Graphs with Bounded Odd Circumference
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 celebrated Erdős and Gallai theorem and a strengthening of Luo’s recent result. The same bound for graphs with bounded even circumferences is a trivial application of the theorem of Li and Ning.
- 24 January 2024
- Published by Springer Nature in Annals of Combinatorics
- Vol. 28 (4) , 1119-1125
Open AccessThe Maximum Number of Cliques in Graphs with Bounded Odd Circumference
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 celebrated Erdős and Gallai theorem and a strengthening of Luo’s recent result. The same bound for graphs with bounded even circumferences is a trivial application of the theorem of Li and Ning.
- 1 October 2023
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 108 (2) , 200-204
For a graph G and a family of graphs F, the Turan number ex(G, F) is the maximum number of edges an F-free subgraph of G can have. We prove that ex(G, F) ≥ ex(Kr, F) if the chromatic number of G is r and F is a family of connected graphs. This result answers a question raised by Briggs and Cox ["Inverting the Turan problem', Discrete Math. 342(7) (2019), 1865-1884] about the inverse Turan number for all connected graphs.
For a graph G and a family of graphs , the Turan number is the maximum number of edges an -free subgraph of G can have. We prove that if the chromatic number of G is r and is a family of connected graphs. This result answers a question raised by Briggs and Cox ['Inverting the Turan problem', Discrete Math.342(7) (2019), 1865-1884] about the inverse Turan number for all connected graphs.
- 1 October 2023
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 108 (2) , 200-204
For a graph G and a family of graphs F, the Turan number ex(G, F) is the maximum number of edges an F-free subgraph of G can have. We prove that ex(G, F) ≥ ex(Kr, F) if the chromatic number of G is r and F is a family of connected graphs. This result answers a question raised by Briggs and Cox ["Inverting the Turan problem', Discrete Math. 342(7) (2019), 1865-1884] about the inverse Turan number for all connected graphs.
For a graph G and a family of graphs , the Turan number is the maximum number of edges an -free subgraph of G can have. We prove that if the chromatic number of G is r and is a family of connected graphs. This result answers a question raised by Briggs and Cox ['Inverting the Turan problem', Discrete Math.342(7) (2019), 1865-1884] about the inverse Turan number for all connected graphs.
- 23 September 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 342, 174-180
Treewidth of the -Kneser graphs- 23 September 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 342, 174-180
Treewidth of the -Kneser graphs- Open Access
- 28 August 2023
- Published by Masaryk University Press in European Conference on Combinatorics, Graph Theory and Applications
- No. 12,p. 526-531
The maximum number of copies of an even cycle in a planar graph
We resolve a conjecture of Cox and Martin by determining asymptotically for every $k\ge 2$ the maximum number of copies of $C_{2k}$ in an $n$-vertex planar graph.- 28 August 2023
- Published by Masaryk University Press in European Conference on Combinatorics, Graph Theory and Applications
- No. 12,p. 526-531
Open AccessThe maximum number of copies of an even cycle in a planar graph
We resolve a conjecture of Cox and Martin by determining asymptotically for every $k\ge 2$ the maximum number of copies of $C_{2k}$ in an $n$-vertex planar graph. - Open Access
Erdős-Ko-Rado Theorem for Bounded Multisets
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, \ldots, n\} $ in which the integers can appear more than once but at most $ m $ times. A family of such $ k $-multisets is called an intersecting family if every pair of $ k $-multisets from the family have non-empty intersection. A finite sequence of real numbers $\{a_1,a_2,\ldots,a_n\}$ is said to be unimodal if there is some $k\in \{1,2,\ldots,n\}$, such that $a_1\leq a_2\leq\ldots\leq a_{k-1}\leq a_k\geq a_{k+1}\geq \ldots\geq a_n$. Given $m,n,k$, denote $C_{k,l}$ as the coefficient of $x^k$ in the generating function $(\sum_{i=1}^mx^i)^l$, where $1\leq l\leq n$. In this paper, we first show that the sequence of $\{C_{k,1},C_{k,2},\ldots,C_{k,n}\}$ is unimodal. Then we use this as a tool to prove that the intersecting family in which every $ k $-multiset contains a fixed element attains the maximum cardinality for $ n \geq k + \lceil k/m\rceil $. In the special case when $m = 1$ and $m=\infty$, our result gives rise to the famous Erdős-Ko-Rado Theorem and an unbounded multiset version for this problem given by Meagher and Purdy, respectively. The main result in this paper can be viewed as a bounded multiset version of the Erdős-Ko-Rado Theorem.Open AccessErdős-Ko-Rado Theorem for Bounded Multisets
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, \ldots, n\} $ in which the integers can appear more than once but at most $ m $ times. A family of such $ k $-multisets is called an intersecting family if every pair of $ k $-multisets from the family have non-empty intersection. A finite sequence of real numbers $\{a_1,a_2,\ldots,a_n\}$ is said to be unimodal if there is some $k\in \{1,2,\ldots,n\}$, such that $a_1\leq a_2\leq\ldots\leq a_{k-1}\leq a_k\geq a_{k+1}\geq \ldots\geq a_n$. Given $m,n,k$, denote $C_{k,l}$ as the coefficient of $x^k$ in the generating function $(\sum_{i=1}^mx^i)^l$, where $1\leq l\leq n$. In this paper, we first show that the sequence of $\{C_{k,1},C_{k,2},\ldots,C_{k,n}\}$ is unimodal. Then we use this as a tool to prove that the intersecting family in which every $ k $-multiset contains a fixed element attains the maximum cardinality for $ n \geq k + \lceil k/m\rceil $. In the special case when $m = 1$ and $m=\infty$, our result gives rise to the famous Erdős-Ko-Rado Theorem and an unbounded multiset version for this problem given by Meagher and Purdy, respectively. The main result in this paper can be viewed as a bounded multiset version of the Erdős-Ko-Rado Theorem. - Open Access
The maximum number of cliques in graphs with bounded odd circumference
In this work, we give the sharp upper bound for the number of cliques in graphs with bounded odd circumferences. This generalized Tur\'an-type result is an extension of the celebrated Erd\H{o}s and Gallai theorem and a strengthening of Luo's recent result. The same bound for graphs with bounded even circumferences is a trivial application of the theorem of Li and Ning.
Open AccessThe maximum number of cliques in graphs with bounded odd circumference
In this work, we give the sharp upper bound for the number of cliques in graphs with bounded odd circumferences. This generalized Tur\'an-type result is an extension of the celebrated Erd\H{o}s and Gallai theorem and a strengthening of Luo's recent result. The same bound for graphs with bounded even circumferences is a trivial application of the theorem of Li and Ning.
- 19 November 2022
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 45 (1) , 1-17
Saturation numbers for disjoint stars
- 19 November 2022
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 45 (1) , 1-17
Saturation numbers for disjoint stars