2 citations · 4 across the 9 of their papers we have counts for
4 papers · 1 filter
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…