Abstract
The Erdős–Stone–Simonovits Theorem implies that the Turán density of a family of graphs is the minimum of the Turán densities of the individual graphs from the family. It was conjectured by Mubayi and Rödl ( J. Combin. Theory Ser. A, submitted) that this is not necessarily true for hypergraphs, in particular for triple systems. We give an example, which shows that their conjecture is true.
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.
