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 条
  • [1] Regular partitions of hypergraphs:: Counting lemmas
    Roedl, Vojtech
    Schacht, Mathias
    COMBINATORICS PROBABILITY & COMPUTING, 2007, 16 (06): : 887 - 901
  • [2] DEFINABLE REGULARITY LEMMAS FOR NIP HYPERGRAPHS
    Chernikov, Artem
    Starchenko, Sergei
    QUARTERLY JOURNAL OF MATHEMATICS, 2021, 72 (04): : 1401 - 1433
  • [3] REGULARITY LEMMAS FOR HYPERGRAPHS AND QUASI-RANDOMNESS
    CHUNG, FRK
    RANDOM STRUCTURES & ALGORITHMS, 1991, 2 (02) : 241 - 252
  • [4] Equivalent regular partitions of three-uniform hypergraphs
    Nagle, Brendan
    Roedl, Vojtech
    Schacht, Mathias
    RANDOM STRUCTURES & ALGORITHMS, 2024, 65 (04) : 703 - 718
  • [5] REGULARITY LEMMAS FOR GRAPHS
    Roedl, Vojtech
    Schacht, Mathias
    FETE OF COMBINATORICS AND COMPUTER SCIENCE, 2010, 20 : 287 - +
  • [6] Arithmetic Progressions, Different Regularity Lemmas and Removal Lemmas
    Szemerédi E.
    Communications in Mathematics and Statistics, 2015, 3 (3) : 315 - 328
  • [7] Judicious partitions of hypergraphs
    Bollobas, B
    Scott, AD
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 1997, 78 (01) : 15 - 31
  • [8] On Regularity Lemmas and their Algorithmic Applications
    Fox, Jacob
    Lovasz, Laszlo Miklos
    Zhao, Yufei
    COMBINATORICS PROBABILITY & COMPUTING, 2017, 26 (04): : 481 - 505
  • [9] Regularity Lemmas and Combinatorial Algorithms
    Bansal, Nikhil
    Williams, Ryan
    2009 50TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE: FOCS 2009, PROCEEDINGS, 2009, : 745 - 754
  • [10] Regularity lemmas for clustering graphs
    1600, Academic Press Inc. (126):
12345