6 papers
Transversal Structures in Graph Systems: A Survey
Wanting Sun, Guanghui Wang, Lan Wei
Given a system of graphs/digraphs/hypergraphs on the common vertex set of size , an -edge graph/digraph/hypergraph on is tran…
Transversal Hamilton cycles in digraph collections
Yangyang Cheng, Heng Li, Wanting Sun +1
Given a collection of digraphs on the common vertex set , an -edge digraph with vertices in is \textit{transversal} in $\mathcal…
A step toward Chen-Lih-Wu conjecture
Yangyang Cheng, Zhenyu Li, Wanting Sun +1
An equitable -coloring of a graph is a proper -coloring where the sizes of any two different color classes differ by at most one. In 1973, Meyer conjectured that every connec…
Subdivision-free graphs with the maximum spectral radius
Wanting Sun, Guanghui Wang, Pingchuan Yang
Given a graph family , let denote the set of -vertex -subdivision-free graphs with the maximum spectral radius. In t…
An El-Zahar Type Theorem in -graphs under Codegree Condition
Yangyang Cheng, Mengjiao Rao, Guanghui Wang +1
A -uniform loose cycle, denoted by , is a -graph on vertices whose vertices can be arranged cyclically so that each hyperedge consists of three consecutive vertices,…
Phase transitions of the ErdÅs-Gyárfás function
Xinyu Hu, Qizhong Lin, Xin Lu +1
Given positive integers . For any integer , an edge coloring of the complete -graph is said to be a -coloring if every copy of receive…