Author:
Rué Juanjo,Spiegel Christoph,Zumalacárregui Ana
Publisher
Springer Science and Business Media LLC
Reference47 articles.
1. Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley-Interscience Series in Discrete Mathematics and Optimization, 3rd edn. Wiley, New York (2008)
2. Baltz, A., Hegarty, P., Knape, J., Larsson, U., Schoen, T.: The Structure of Maximum Subsets of $$\{1,\dots ,n\}$$ { 1 , ⋯ , n } with No Solutions to $$a+b=kc$$ a + b = k c . Electron. J. Combin. 12:Research Paper 19, 16 (2005)
3. Beck, M., Robins, S.: Computing the Continuous Discretely. Undergraduate Texts in Mathematics. Integer-Point Enumeration in Polyhedra. Springer, New York (2007)
4. Behrend, F.A.: On sets of integers which contain no three terms in arithmetical progression. Proc. Nat. Acad. Sci. USA 32, 331–332 (1946)
5. Bloom, T.F.: A quantitative improvement for Roth’s theorem on arithmetic progressions. J. London Math. Soc. 93(3), 643–663 (2016)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献