Regular partitions of hypergraphs:: Regularity lemmas

被引:61
|
作者
Roedl, Vojtech [1 ]
Schacht, Mathias
机构
[1] Emory Univ, Dept Math & Comp Sci, Atlanta, GA 30322 USA
[2] Humboldt Univ, Inst Informat, D-10099 Berlin, Germany
来源
COMBINATORICS PROBABILITY & COMPUTING | 2007年 / 16卷 / 06期
关键词
ERGODIC SZEMEREDI THEOREM;
D O I
10.1017/S0963548307008553
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Szemeredi'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.
引用
收藏
页码:833 / 885
页数:53
相关论文
共 50 条
  • [31] Pasting Lemmas and Characterizations of Boundary Regularity for Quasiminimizers
    Anders Björn
    Olli Martio
    Results in Mathematics, 2009, 55
  • [32] Regularity in kinetic formulations via averaging lemmas
    Jabin, PE
    Perthame, B
    ESAIM-CONTROL OPTIMISATION AND CALCULUS OF VARIATIONS, 2002, 8 : 761 - 774
  • [33] MAXIMAL GAIN OF REGULARITY IN VELOCITY AVERAGING LEMMAS
    Arsenio, Diogo
    Masmoudi, Nader
    ANALYSIS & PDE, 2019, 12 (02): : 333 - 388
  • [34] Cyclic partitions of complete uniform hypergraphs
    Szymanski, Artur
    Wojda, A. Pawel
    ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):
  • [35] An algorithmic regularity lemma for hypergraphs
    Czygrinow, A
    Rödl, V
    SIAM JOURNAL ON COMPUTING, 2000, 30 (04) : 1041 - 1066
  • [36] Decomposition of regular hypergraphs
    Choi, Jeong Ok
    West, Douglas B.
    JOURNAL OF COMBINATORICS, 2018, 9 (01) : 21 - 33
  • [37] PARTITIONS OF GRAPHS INTO COVERINGS AND HYPERGRAPHS INTO TRANSVERSALS
    DEWERRA, D
    COMMENTARII MATHEMATICI HELVETICI, 1974, 49 (02) : 175 - 178
  • [38] Pasting Lemmas and Characterizations of Boundary Regularity for Quasiminimizers
    Bjorn, Anders
    Martio, Olli
    RESULTS IN MATHEMATICS, 2009, 55 (3-4) : 265 - 279
  • [39] STAR PARTITIONS AND REGULARITY IN GRAPHS
    ROWLINSON, P
    LINEAR ALGEBRA AND ITS APPLICATIONS, 1995, 226 : 247 - 265
  • [40] Approximate counting of regular hypergraphs
    Dudek, Andrzej
    Frieze, Alan
    Rucinski, Andrzej
    Sileikis, Matas
    INFORMATION PROCESSING LETTERS, 2013, 113 (19-21) : 785 - 788