Chuanqi Xiao

activity

20192022

most citedA note on the Turán number of disjoint union of wheels

2 citations · 6 across the 7 of their papers we have counts for

collaborators

8 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.CO2021

The Turán Number of the Triangular Pyramid of $3$ -Layers

Debarun Ghosh, Ervin Győri, Addisu Paulos +2

The Turán number of a graph $H$ , denoted by $ex (n, H)$ , is the maximum number of edges in an $n$ -vertex graph that does not have $H$ as a subgraph. Let $T P_{k}$ be the triangu…

math.CO2020★ 2 cited

Turán numbers and anti-Ramsey numbers for short cycles in complete $3$ -partite graphs

Chunqiu Fang, Ervin Győri, Chuanqi Xiao +1

We call a $4$ -cycle in $K_{n_{1}, n_{2}, n_{3}}$ multipartite, denoted by $C_{4}^{multi}$ , if it contains at least one vertex in each part of $K_{n_{1}, n_{2}, n_{3}}$ . The…

math.CO2020★ 2 cited

A note on the Turán number of disjoint union of wheels

Chuanqi Xiao, Oscar Zamora

The Turán number of a graph $H$ , $ex (n, H)$ , is the maximum number of edges in a graph on $n$ vertices which does not have $H$ as a subgraph. A wheel $W_{n}$ is an $n$ -vertex g…

math.CO2020★ 1 cited

Planar Turán number of the 6-cycle

Debarun Ghosh, Ervin Győri, Ryan R. Martin +2

Let $ex_{P} (n, T, H)$ denote the maximum number of copies of $T$ in an $n$ -vertex planar graph which does not contain $H$ as a subgraph. When $T = K_{2}$ , ${\rm ex}_{\mat…

math.CO2020

The number of triangles is more when they have no common vertex

Chuanqi Xiao, Gyula O. H. Katona

By the theorem of Mantel $[5]$ it is known that a graph with $n$ vertices and $⌊ \frac{n ^{2}}{4} ⌋ + 1$ edges must contain a triangle. A theorem of Erdős gives a strength…