Chuanqi Xiao
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
Research Interests
Chuanqi Xiao has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Ervin Győri
HUN-REN Alfréd Rényi Institute of Mathematics 1053 Budapest Hungary
12 shared publications - Addisu Paulos
Central European University, Budapest, Hungary
7 shared publications - Debarun Ghosh
Central European University Budapest
5 shared publications - Gyula O. H. Katona
Alfréd Rényi Institute of Mathematics, Budapest, Hungary
4 shared publications Oscar Zamora
4 shared publications- Oscar Zamora
Central European University Budapest
4 shared publications
Latest Publications
- 24 July 2024
- Published by Akademiai Kiado Zrt. in Studia Scientiarum Mathematicarum Hungarica
- Vol. 61 (2) , 89-115
Planar Turán Number of the Θ6
Let F be a nonempty family of graphs. A graph 𝐺 is called F -free if it contains no graph from F as a subgraph. For a positive integer 𝑛, the planar Turán number of F, denoted by exp (𝑛, F), is the maximum number of edges in an 𝑛-vertex F -free planar graph.Let Θ
- 24 July 2024
- Published by Akademiai Kiado Zrt. in Studia Scientiarum Mathematicarum Hungarica
- Vol. 61 (2) , 89-115
Planar Turán Number of the Θ6
Let F be a nonempty family of graphs. A graph 𝐺 is called F -free if it contains no graph from F as a subgraph. For a positive integer 𝑛, the planar Turán number of F, denoted by exp (𝑛, F), is the maximum number of edges in an 𝑛-vertex F -free planar graph.Let Θ
- 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.
- Open Access
- 7 December 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (3)
Book free 3-uniform hypergraphs
- 7 December 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (3)
Open AccessBook free 3-uniform hypergraphs
- Open Access
Book free $3$-Uniform Hypergraphs
A $k$-book in a hypergraph consists of $k$ Berge triangles sharing a common edge. In this paper we prove that the number of the hyperedges in a $k$-book-free 3-uniform hypergraph on $n$ vertices is at most $\frac{n^2}{8}(1+o(1))$.Open AccessBook free $3$-Uniform Hypergraphs
A $k$-book in a hypergraph consists of $k$ Berge triangles sharing a common edge. In this paper we prove that the number of the hyperedges in a $k$-book-free 3-uniform hypergraph on $n$ vertices is at most $\frac{n^2}{8}(1+o(1))$. - 4 October 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 346 (1)
Generalized outerplanar Turán number of short paths
- 4 October 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 346 (1)
Generalized outerplanar Turán number of short paths
- Open Access
Generalized outerplanar Turán number of short paths
Let $H$ be a graph. The generalized outerplanar Tur\'an number of $H$, denoted by $f_{\mathcal{OP}}(n,H)$, is the maximum number of copies of $H$ in an $n$-vertex outerplanar graph. Let $P_k$ be the path on $k$ vertices. In this paper we give an exact value of $f_{\mathcal{OP}}(n,P_4)$ and a best asymptotic value of $f_{\mathcal{OP}}(n,P_5)$. Moreover, we characterize all outerplanar graphs containing $f_{\mathcal{OP}}(n,P_4)$ copies of $P_4$.Open AccessGeneralized outerplanar Turán number of short paths
Let $H$ be a graph. The generalized outerplanar Tur\'an number of $H$, denoted by $f_{\mathcal{OP}}(n,H)$, is the maximum number of copies of $H$ in an $n$-vertex outerplanar graph. Let $P_k$ be the path on $k$ vertices. In this paper we give an exact value of $f_{\mathcal{OP}}(n,P_4)$ and a best asymptotic value of $f_{\mathcal{OP}}(n,P_5)$. Moreover, we characterize all outerplanar graphs containing $f_{\mathcal{OP}}(n,P_4)$ copies of $P_4$. - Open Access
Stability version of Dirac's theorem and its applications for generalized Turán problems
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 version of this result by characterizing those graphs with minimum degree $k$ and circumference at most $2k+1$. We present applications of the above-stated result by obtaining generalized Tur\'an numbers. In particular, for all $\ell \geq 5$ we determine how many copies of a five-cycle as well as four-cycle are necessary to guarantee that the graph has circumference larger than $\ell$. In addition, we give a new proof of Luo's Theorem for cliques using our stability result.Open AccessStability version of Dirac's theorem and its applications for generalized Turán problems
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 version of this result by characterizing those graphs with minimum degree $k$ and circumference at most $2k+1$. We present applications of the above-stated result by obtaining generalized Tur\'an numbers. In particular, for all $\ell \geq 5$ we determine how many copies of a five-cycle as well as four-cycle are necessary to guarantee that the graph has circumference larger than $\ell$. In addition, we give a new proof of Luo's Theorem for cliques using our stability result. - 14 May 2022
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 317, 75-85
The Turán number of the triangular pyramid of 3-layers
- 14 May 2022
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 317, 75-85
The Turán number of the triangular pyramid of 3-layers
- Open Access
- 1 January 2022
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 307, 1-14
The Turán number of the square of a path
- 1 January 2022
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 307, 1-14
Open AccessThe Turán number of the square of a path
- Open Access
The Maximum Number of Paths of Length Four in a Planar Graph
Let $f(n,H)$ denote the maximum number of copies of $H$ in an $n$-vertex planar graph. The order of magnitude of $f(n,P_k)$, where $P_k$ is a path on $k$ vertices, is $n^{{\lfloor{\frac{k-1}{2}}\rfloor}+1}$. In this paper we determine the asymptotic value of $f(n,P_5)$ and give conjectures for longer paths.Open AccessThe Maximum Number of Paths of Length Four in a Planar Graph
Let $f(n,H)$ denote the maximum number of copies of $H$ in an $n$-vertex planar graph. The order of magnitude of $f(n,P_k)$, where $P_k$ is a path on $k$ vertices, is $n^{{\lfloor{\frac{k-1}{2}}\rfloor}+1}$. In this paper we determine the asymptotic value of $f(n,P_5)$ and give conjectures for longer paths.