Abstract
A collection A0,A1,…,At of finite sets is called a pseudo sunflower of size t+1 and with center C if C is a proper subset of A0 and the sets A0∖C,…,At∖C are pairwise disjoint. The main result shows that every collection of more than tk distinct k-element sets contains a pseudo sunflower of size t+1. The bound is best possible.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
