Showing 2026Show all
2 papers · 1 filter
math.CO2026
A proof of the strong Erdős--Frankl--Füredi cover-free conjecture
Yanan Hu, Leilei Zhang
A family of nonempty sets is -cover-free if no member is contained in the union of at most other members. Let denote the least for which there is an -cover-fre…
math.CO2026
A Sharp Ramsey Theorem for Admissible Colorings of Ordered Cliques
Yanan Hu, Zhenhua Lyu, Chenxi Yang
Let \(f(k)\) be the minimum integer \(N\) such that any red--blue edge-coloring of the ordered complete graph on \(N\) vertices contains a set of \(k\) vertices whose induced color…