Abstract
AbstractThe regularity method was pioneered by Szemerédi for graphs and is an important tool in extremal combinatorics. Over the last two decades, several extensions to hypergraphs were developed which were based on seemingly different notions of quasirandom hypergraphs. We consider the regularity lemmata for three‐uniform hypergraphs of Frankl and Rödl and of Gowers, and present a new proof that the concepts behind these approaches are equivalent.
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.
