# 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} }

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

8 Citations

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 32 REFERENCES

Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs

- Computer Science, Mathematics
- 2007

34