6 papers
Perfect matching in 4-partite 4-uniform hypergraphs
Hongliang Lu, Yan Wang, Feihong Yuan
A balanced -partite -graph is a -uniform hypergraph such that every edge intersects each partition class in exactly one vertex, where each partition class has size . Lo…
On the codegree threshold for Hamilton -cycles in -uniform hypergraphs
Hongliang Lu, Feihong Yuan
In this note, we resolve the remaining open case of a conjecture by Han and Zhao concerning the codegree threshold for Hamilton -cycles in -uniform hypergraphs. Specifical…
A local spectral condition for perfect matchings in 3-graphs
Huiqiu Lin, Hongliang Lu, Feihong Yuan +1
Let be a constant such that , and let be a sufficiently large integer. Consider a -uniform hypergraph on vertices. In 2013, Kühn, Osthus, and Treglo…
Stability for the Anti-Ramsey Number of Matchings
Xuechun Zhang, Hongliang Lu
Let be three positive integers such that . Let denote the complete graph of order . Given a graph , the anti-Ramsey number is defined as…
Rainbow perfect matchings in 3-partite 3-uniform hypergraphs
Hongliang Lu, Yan Wang
Let be nonnegative integers such that and . Let \[δ(n,r,s)=\left\{\begin{array}{ll} n^2-(n-r)^2 &\text{if}\ s=1 , \\[5pt] n^2-(n-r+1)(n-r-1)…
Anti-Ramsey Number of Friendship Graphs
Wenke Liu, Hongliang Lu, Xinyue Luo
An edge-colored graph is called \textit{rainbow graph} if all the colors on its edges are distinct. For a given positive integer and a family of graphs , the anti-…