23 citations · 53 across the 24 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2024
Sumsets in the Hypercube
Noga Alon, Or Zamir
A subset of the Boolean hypercube is a sumset if for some . We prove that the number of sumse…
math.CO2023★ 3 cited
Essentially tight bounds for rainbow cycles in proper edge-colourings
Noga Alon, Matija Bucić, Lisa Sauermann +2
An edge-coloured graph is said to be rainbow if no colour appears more than once. Extremal problems involving rainbow objects have been a focus of much research over the last decad…