Abstract
AbstractFor a given r ‐uniform hypergraph ${\cal F}$ we study the largest blow‐up of ${\cal F}$ which can be guaranteed in every large r ‐uniform hypergraph with many copies of ${\cal F}$. For graphs this problem was addressed by Nikiforov, who proved that every n ‐vertex graph that contains Ω(nℓ) copies of the complete graph Kℓ must contain a complete ℓ ‐partite graph with Ω(log n) vertices in each class. We give another proof of Nikiforov's result, make very small progress towards that problem for hypergraphs, and consider a Ramsey‐type problem related to a conjecture of Erdős and Hajnal.© 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012
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.
