Abstract

Szemerédi?s regularity lemma guarantees that, for fixed \(0\), every graph \(G = (V, E)\) admits an \(\varepsilon\)-regular and \(t\)-equitable partition \(\Pi (G)\), where \(t = O(1)\). These partitions are constructed by Kohayakawa, Rödl, and Thoma in time \(O(|V|^2)\). Analogous partitions of \(k\)-graphs \(H^(k)\) are constructed by Czygrinow and Rödl in time \(O(|V|^2k-1 łog^5 |V|)\). For \(k=3\), we construct these partitions (and others with slightly stronger regularity) in time \(O(|V|^3)\). We also discuss some applications.

Links and resources

Tags

community

  • @tabularii
  • @dblp
@tabularii's tags highlighted