Publisher
Springer Berlin Heidelberg
Reference58 articles.
1. N. Alon, E. Fischer, M. Krivelevich and B. Szegedy, Efficient testing of large graphs, Proc. of 40th FOCS, New York, NY, IEEE (1999), 656–666. Also: Combinatorica, 20 (2000), 451-476.
2. T. Austin, Deducing the multidimensional Szemerédi Theorem from an infinitary removal lemma, preprint, arXiv:0808.2267.
3. T. Austin, Deducing the Density Hales-Jewett Theorem from an infinitary removal lemma, preprint, arXiv:0903.1633.
4. V. Bergelson, B. Host and B. Kra, Multiple recurrence and nilsequences, with an appendix by Imre Ruzsa, Invent Math., 160 (2005), no. 2, 261–303.
5. V. Bergelson, A. Leibman and E. Lesigne, Weyl complexity of a system of polynomials and constructions in combinatorial number theory, J. D’Analyse Mathématique, 103 (2007), 47–92.
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献