2 papers
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…
math.CO2025
On graphs without cycles of length 1 modulo 3
Yandong Bai, Binlong Li, Yufeng Pan +1
Burr and ErdÅs conjectured in 1976 that for every two integers satisfying that contains an even integer, an -vertex graph containing no c…