Chuanqi Xiao

activity

20192026

most citedSet systems related to a house allocation problem

6 citations · 17 across the 14 of their papers we have counts for

collaborators

16 papers

math.CO2026

Turán numbers of triangular pyramids

Chuanqi Xiao, Long-Tu Yuan, Xiaowen Zhang

Let $\TP_k$ denote the triangular pyramid with $k$ layers. For a graph family $F$ , let $\ex(n,\mathcal F)$ be the maximum number of edges in an $n$ -vertex graph containing…

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

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.CO2021★ 3 cited

Planar Turán Number of Double Stars

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

Given a graph $F$ , the planar Turán number of $F$ , denoted $ex_{P} (n, F)$ , is the maximum number of edges in an $n$ -vertex $F$ -free planar graph. Such an extremal…

math.CO2021

Generalized outerplanar Turán number of short paths

Ervin Győri, Addisu Paulos, Chuanqi Xiao

Let $H$ be a graph. The generalized outerplanar Turán number of $H$ , denoted by $f_{O P} (n, H)$ , is the maximum number of copies of $H$ in an $n$ -vertex outerplanar graph.…

math.CO2021

Book free $3$ -Uniform Hypergraphs

Debarun Ghosh, Ervin Győri, Judit Nagy-György +3

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

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

Planar Turán Number of the $Θ_{6}$

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

Let $F$ be a nonempty family of graphs. A graph $G$ is called $F$ -\textit{free} if it contains no graph from $F$ as a subgraph. For a positive integer…

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 Maximum Number of Paths of Length Four in a Planar Graph

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

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

math.CO2020★ 1 cited

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…

math.CO2020★ 1 cited

Wiener Index of Quadrangulation Graphs

Ervin Győri, Addisu Paulos, Chuanqi Xiao

The Wiener index of a graph $G$ , denoted $W (G)$ , is the sum of the distances between all pairs of vertices in $G$ . É. Czabarka, et al. conjectured that for an $n$ -vertex, $n \geq 4$ …

math.CO2019

The Turán number of the square of a path

Chuanqi Xiao, Gyula O. H. Katona, Jimeng Xiao +1

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. Let P_k be the path with k vertices, the square…

math.CO2019★ 6 cited

Set systems related to a house allocation problem

Dániel Gerbner, Balázs Keszegh, Abhishek Methuku +4

We are given a set $A$ of buyers, a set $B$ of houses, and for each buyer a preference list, i.e., an ordering of the houses. A house allocation is an injective mapping $τ$ from $A…

Turán numbers of triangular pyramids

The maximum number of cliques in graphs with bounded odd circumference

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

Planar Turán Number of Double Stars

Generalized outerplanar Turán number of short paths

Book free 3-Uniform Hypergraphs

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

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

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

Planar Turán Number of the Θ6​

Planar Turán number of the 6-cycle

The Maximum Number of Paths of Length Four in a Planar Graph

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

Wiener Index of Quadrangulation Graphs

The Turán number of the square of a path

Set systems related to a house allocation problem

Book free $3$ -Uniform Hypergraphs

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

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

Planar Turán Number of the $Θ_{6}$