3 papers
math.CO2026
Most probably trangle-free graphs
Yuhang Bai, Gyula O. H. Katona, Zixuan Yang
The celebrated Mantel's theorem states that any triangle-free graph on vertices contains at most edges. It is natural to ask how many triangle…
cs.DS2025
Approximating maximum properly colored forests via degree bounded independent sets
Yuhang Bai, Kristóf Bérczi, Johanna K. Siemelink
In the Maximum-size Properly Colored Forest problem, we are given an edge-colored undirected graph and the goal is to find a properly colored forest with as many edges as possible.…
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 .…