2 citations · 4 across the 9 of their papers we have counts for
9 papers
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…
Turán numbers and anti-Ramsey numbers for short cycles in complete -partite graphs
Chunqiu Fang, Ervin Győri, Chuanqi Xiao +1
We call a -cycle in multipartite, denoted by , if it contains at least one vertex in each part of . The…
The anti-Ramsey number of and in the complete -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 and a family of graphs, the anti-Ramsey number $ar(G, \math…
Largest family without a pair of posets on consecutive levels of the Boolean lattice
Gyula O. H. Katona, Jimeng Xiao
Suppose is an integer. Let be the poset with elements such that and let be th…
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…
Minimal colorings for properly colored subgraphs in complete graphs
Chunqiu Fang, Ervin Győri, Jimeng Xiao
Let be the maximum number of colors in an edge-coloring of with no properly colored copy of . In this paper, we show that $pr(K_{n}, G)-ex(n, \mathcal{G'}…
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 in a complete graph , denoted…
On forbidden poset problems in the linear lattice
Jimeng Xiao, Casey Tompkins
In this note, we determine the maximum size of a -free family in the lattice of vector subspaces of a finite vector space both in the non-induced case as well as…
A Common Generalization to Theorems on Set Systems with -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…