A sunflower anti-Ramsey theorem and its applications
Combinatorics
2015-05-21 v1
Abstract
A -sunflower in a hypergraph is a family of edges with vertices in common. We show that if we colour the edges of a complete hypergraph in such a way that any monochromatic -sunflower has at most petals, then it contains a large rainbow complete subhypergraph. This extends a theorem by Lefmann, R\"odl and Wysocka, but this version can be applied to problems in geometry and algebra. We also give an infinite version of the theorem.
Keywords
Cite
@article{arxiv.1505.05170,
title = {A sunflower anti-Ramsey theorem and its applications},
author = {Leonardo Martínez-Sandoval and Miguel Raggi and Edgardo Roldán-Pensado},
journal= {arXiv preprint arXiv:1505.05170},
year = {2015}
}