Combinatorics, Probability and Computing
- Combinatorics, Probability and Computing / Volume 16 / Issue 06 / November 2007, pp 887-901
- Copyright © Cambridge University Press 2007
- DOI: http://dx.doi.org/10.1017/S0963548307008565 (About DOI), Published online: 31 July 2007
Paper
Regular Partitions of Hypergraphs: Counting Lemmas
VOJTĚCH RÖDLa1† and MATHIAS SCHACHTa2‡
a1 Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322, USA (e-mail: rodl@mathcs.emory.edu)
a2 Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany (e-mail: schacht@informatik.hu-berlin.de)
Abstract
We continue the study of regular partitions of hypergraphs. In particular, we obtain corresponding counting lemmas for the regularity lemmas for hypergraphs from our paper ‘Regular Partitions of Hypergraphs: Regularity Lemmas’ (in this issue).
(Received March 25 2005)
(Revised January 14 2007)
Footnotes
† Research partially supported by NSF grant DMS 0300529.
‡ Research supported by DFG grant SCHA 1263/1-1.
