2 papers
math.CO2025
The Turán number of Berge matchings
Yichen Wang, Zixuan Yang, Xiamiao Zhao +2
Given a graph , an -uniform hypergraph is a {\em Berge-} if there is a bijection such that for each .…
math.CO2025
On saturation problems for matchings with regularity constraints
Gang Yang, Zixuan Yang, Shenggui Zhang
A graph is -saturated if is -free but for any edge in the complement of the graph contains . Gerbner et al. (Discrete Math., 345 (2022), 112921) in…