{"paper":{"title":"A sunflower anti-Ramsey theorem and its applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Edgardo Rold\\'an-Pensado, Leonardo Mart\\'inez-Sandoval, Miguel Raggi","submitted_at":"2015-05-19T20:19:25Z","abstract_excerpt":"A $h$-sunflower in a hypergraph is a family of edges with $h$ vertices in common. We show that if we colour the edges of a complete hypergraph in such a way that any monochromatic $h$-sunflower has at most $\\lambda$ 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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05170","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}