Abstract
AbstractA k‐uniform hypergraph with n vertices is an ‐omitting system if it has no two edges with intersection size . If in addition it has no two edges with intersection size greater than , then it is an ‐system. Rödl and Šiňajová proved a sharp lower bound for the independence number of ‐systems. We consider the same question for ‐omitting systems. Our proofs use adaptations of the random greedy independent set algorithm, and pseudorandom graphs. We also prove related results where we forbid more than two edges with a prescribed common intersection size leading to some applications in Ramsey theory. For example, we obtain good bounds for the Ramsey number , where F is the k‐uniform Fan. The behavior is quite different than the case which is the classical Ramsey number .
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
