Jimeng Xiao

activity

20172022

most citedTurán numbers and anti-Ramsey numbers for short cycles in complete

3

-partite graphs

2 citations · 4 across the 9 of their papers we have counts for

collaborators

Showing 2020Show all

3 papers · 1 filter

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★ 1 cited

The anti-Ramsey number of $C_{3}$ and $C_{4}$ in the complete $r$ -partite graphs

Chunqiu Fang, Ervin Győri, Binlong Li +1

A subgraph of an edge-colored graph is rainbow, if all of its edges have different colors. For a graph $G$ and a family $H$ of graphs, the anti-Ramsey number $ar(G, \math…

math.CO2020

Largest family without a pair of posets on consecutive levels of the Boolean lattice

Gyula O. H. Katona, Jimeng Xiao

Suppose $k \geq 2$ is an integer. Let $Y_{k}$ be the poset with elements $x_{1}, x_{2}, y_{1}, y_{2}, \dots, y_{k - 1}$ such that $y_{1} < y_{2} < \dots < y_{k - 1} < x_{1}, x_{2}$ and let $Y_{k}^{'}$ be th…

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

The anti-Ramsey number of C3​ and C4​ in the complete r-partite graphs

Largest family without a pair of posets on consecutive levels of the Boolean lattice

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

The anti-Ramsey number of $C_{3}$ and $C_{4}$ in the complete $r$ -partite graphs