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 math.COShow all

9 papers · 1 filter

math.CO2022

Anti-Ramsey numbers for vertex-disjoint triangles

Fangfang Wu, Shenggui Zhang, Binlong Li +1

An edge-colored graph is called rainbow if all the colors on its edges are distinct. Given a positive integer n and a graph G, the anti-Ramsey number ar(n,G) is the maximum number…

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…

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

Minimal colorings for properly colored subgraphs in complete graphs

Chunqiu Fang, Ervin Győri, Jimeng Xiao

Let $p r (K_{n}, G)$ be the maximum number of colors in an edge-coloring of $K_{n}$ with no properly colored copy of $G$ . In this paper, we show that $pr(K_{n}, G)-ex(n, \mathcal{G'}…

math.CO2019

On the anti-Ramsey number of forests

Chunqiu Fang, Ervin Győri, Mei Lu +1

We call a subgraph of an edge-colored graph rainbow subgraph, if all of its edges have different colors. The anti-Ramsey number of a graph $G$ in a complete graph $K_{n}$ , denoted…

math.CO2019★ 1 cited

On forbidden poset problems in the linear lattice

Jimeng Xiao, Casey Tompkins

In this note, we determine the maximum size of a ${V_{k}, Λ_{l}}$ -free family in the lattice of vector subspaces of a finite vector space both in the non-induced case as well as…

math.CO2017

A Common Generalization to Theorems on Set Systems with $L$ -intersections

Jiuqiang Liu, Shenggui Zhang, Jimeng Xiao

In this paper, we provide a common generalization to the well-known Erdős-Ko-Rado Theorem, Frankl-Wilson Theorem, Alon-Babai-Suzuki Theorem, and Snevily Theorem on set systems with…

Anti-Ramsey numbers for vertex-disjoint triangles

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

The Turán number of the square of a path

Minimal colorings for properly colored subgraphs in complete graphs

On the anti-Ramsey number of forests

On forbidden poset problems in the linear lattice

A Common Generalization to Theorems on Set Systems with L-intersections

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

A Common Generalization to Theorems on Set Systems with $L$ -intersections