Regular Partitions of Hypergraphs: Counting Lemmas

Vojtech Rödl, Mathias Schacht. Regular Partitions of Hypergraphs: Counting Lemmas. Combinatorics, Probability & Computing, 16(6):887-901, 2007. [doi]

@article{RodlS07a,
  title = {Regular Partitions of Hypergraphs: Counting Lemmas},
  author = {Vojtech Rödl and Mathias Schacht},
  year = {2007},
  doi = {10.1017/S0963548307008565},
  url = {http://dx.doi.org/10.1017/S0963548307008565},
  tags = {partitioning},
  researchr = {https://researchr.org/publication/RodlS07a},
  cites = {0},
  citedby = {0},
  journal = {Combinatorics, Probability & Computing},
  volume = {16},
  number = {6},
  pages = {887-901},
}