Efficient arithmetic regularity and removal lemmas for induced bipartite patterns

@article{Alon2018EfficientAR,
  title={Efficient arithmetic regularity and removal lemmas for induced bipartite patterns},
  author={N. Alon and J. Fox and Y. Zhao},
  journal={arXiv: Combinatorics},
  year={2018},
  pages={7757}
}
  • N. Alon, J. Fox, Y. Zhao
  • Published 2018
  • Mathematics
  • arXiv: Combinatorics
  • Efficient arithmetic regularity and removal lemmas for induced bipartite patterns, Discrete Analysis 2019:3, 14 pp. This paper provides a common extension of two recent lines of work: the study of arithmetic regularity lemmas under the model-theoretic assumption of stability initiated by Terry and Wolf, and that of graph regularity lemmas for graphs of bounded VC-dimension provided by Lovasz and Szegedy (following prior work of Alon, Fischer and Newman) and extended to hypergraphs by Fox, Pach… CONTINUE READING
    Quantitative structure of stable sets in arbitrary finite groups.
    1
    Structure and regularity for subsets of groups with finite VC-dimension
    9
    On finite sets of small tripling or small alternation in arbitrary groups
    4
    Quantitative structure of stable sets in finite abelian groups
    7
    The coset and stability rings
    3
    Approximate subgroups with bounded VC-dimension

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 32 REFERENCES
    Bounds for graph regularity and removal lemmas
    86
    Regularity lemmas for stable graphs
    57
    Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
    34
    Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension
    6
    The structure of almost all graphs in a hereditary property
    63
    Efficient testing of large graphs
    197
    Regular Partitions of Graphs
    1003
    Stable arithmetic regularity in the finite-field model
    15
    A new proof of the graph removal lemma
    • J. Fox
    • Mathematics, Computer Science
    • 2010
    130