Showing math.COShow all
3 papers · 1 filter
math.CO2026
Joins and ear decompositions beyond graphic matroids
Yuhang Bai, Kristóf Bérczi, Chaitanya Nalam
For a matroid , a join is a set that meets every circuit in at most elements. Let denote the maximum size of a join. Motivated by Frank's mi…
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…
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 .…