14 citations · 17 across the 16 of their papers we have counts for
11 papers · 1 filter
Strongly separating graph edges with paths
Xiao-Chuan Liu, Boyan Xu, Xu Yang
A family of paths strongly separates the edges of a graph if every two distinct edges are separated in both directions by paths in the family. Bonamy, Botler, Dross, Naia, and Skok…
Sharp Same-Color Cycle Covers in Two-Colored Complete Graphs
Xiao-Chuan Liu, Jonatas Teodomiro, Xu Yang
We extend the conjecture of Erdős and Gyárfás on monochromatic path covers to the setting of monochromatic cycle covers. We prove that, for all , every 2-edge-coloring of the co…
A rainbow version of Lehel's conjecture
Pedro Araújo, Xiao-Chuan Liu, Taísa Martins +4
Lehel's conjecture states that every 2-edge-colouring of K_n admits a partition of its vertex set into two monochromatic cycles. It was proven for sufficiently large n by Łuczak, R…
Linear Lower Bounds for the Modular Chromatic Index
Xiao-Chuan Liu, Boyan Xu, Xu Yang
Let be an integer. A edge-coloring of a graph is an edge-coloring in which every nonzero degree in each color class is congruent to modulo . Let $χ'_…
Large Monochromatic Components in Colored Random Graphs
Xiao-Chuan Liu, Xu Yang
We study the size of the largest monochromatic connected component that must appear in any edge-coloring of a random graph. Let with and , and wri…
On Turán Number of Graphs with Small Minimum Feedback Vertex Numbers
Xiao-Chuan Liu, Xu Yang
Given a graph , the minimum feedback vertex number of is the minimum number of vertices whose removal results in an acyclic graph. In this paper, we investigate Turán-type e…
More on Rainbow Cliques in Edge-Colored Graphs
Xiao-Chuan Liu, Danni Peng, Xu Yang
In an edge-colored graph , a rainbow clique is a -complete subgraph in which all the edges have distinct colors. Let and be the number of edges and colors…
On Color Isomorphic Pairs in Proper Edge Colourings of Complete Graphs
Xiao-Chuan Liu, Xu Yang
Following the recent paper which initiated the study of colour isomorphism problems for complete graphs, we obtain upper bounds for for a family of graphs obtained a…
Turán Number of Subdivisions of Multipartite Graphs
Xiao-Chuan Liu, Danni Peng, Xu Yang
In this paper, we investigate the Turán exponent for -subdivisions of graphs that are neither bipartite nor complete. Specifically, we establish an upper bound on the Turán numb…
On the Turán Number of Generalized Theta Graphs
Xiao-Chuan Liu, Xu Yang
Let denote the generalized theta graph, which consists of internally disjoint paths with lengths , connecting two fixed vertice…
On flushed partitions and concave compositions
Xiaochuan Liu
In this work, we give combinatorial proofs for generating functions of two problems, i.e., flushed partitions and concave compositions of even length. We also give combinatorial in…