Indexed metadata
Regular Partitions of Hypergraphs: Regularity Lemmas
VOJTĚCH RÖDL, MATHIAS SCHACHT
Source record
Source: Crossref
Published: Nov 1, 2007
DOI: 10.1017/s0963548307008553
Open original source ↗Source abstract
Szemerédi's regularity lemma for graphs has proved to be a powerful tool with many subsequent applications. The objective of this paper is to extend the techniques developed by Nagle, Skokan, and the authors and obtain a stronger and more ‘user-friendly’ regularity lemma for hypergraphs.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.