Hypergraph regularity and the multidimensional Szemerédi theorem

Simple item page
dc.creatorGowers, W. T.
dc.date2007-10-16
dc.date.accessioned2026-07-07T08:36:37Z
dc.date.available2026-07-07T08:36:37Z
dc.descriptionWe prove analogues for hypergraphs of Szemerédi's regularity lemma and the associated counting lemma for graphs. As an application, we give the first combinatorial proof of the multidimensional Szemerédi theorem of Furstenberg and Katznelson, and the first proof that provides an explicit bound. Similar results with the same consequences have been obtained independently by Nagle, Rödl, Schacht and Skokan.
dc.description53 pages
dc.identifierhttps://arxiv.org/abs/0710.3032
dc.identifierhttp://arxiv.org/abs/0710.3032
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/140126
dc.subjectCombinatorics
dc.subject05D05
dc.titleHypergraph regularity and the multidimensional Szemerédi theorem
dc.typetext

Files

Collections

arXiv