2 papers
math.CO2025
Degree conditions for spanning expansion hypertrees
Mengjiao Rao, Nicolás Sanhueza-Matamala, Lin Sun +2
The -expansion of a graph is the -uniform hypergraph obtained from by adding new vertices to every edge. We determine, for all , asymptotically op…
math.CO2025
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,…