3 papers
math.CO2025
The Oddtown problem modulo a composite number
Boris Bukh, Ting-Wei Chao, Zeyu Zheng
A family of subsets of an -element set is called an -Oddtown if the sizes of all sets are not divisible by , but the sizes of pairwise intersections ar…
math.CO2025
The generalized trifference problem
Anurag Bishnoi, BartÅomiej Kielak, Benedek Kovács +4
We study the problem of finding the largest number of ternary vectors of length such that for any three distinct vectors there are at least coordinates where they…
math.CO2025
On the number of edges in saturated partial embeddings of maximal planar graphs
János Barát, Zoltán L. Blázsik, Balázs Keszegh +1
We investigate the extremal properties of saturated partial plane embeddings of maximal planar graphs. For a planar graph , the plane-saturation number $\mathrm{sat}_{\mathcal{P…