Author:
Füredi Zoltán,Jockusch Carl G.,Rubel Lee A.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference8 articles.
1. R. Downey, Z. Füredi, C. Jockusch andL. A. Rubel: Difference sets and recursion theory, in preparation
2. P. Erdős andR. Rado: Intersection theorems for systems of sets,J. London Math. Soc.
35 (1960), 85–90.
3. P. Erdős, A. Sárközy, andV. T. Sós: On additive properties of general sequences,Discrete Math,136 (1994), 75–99.
4. Z. Füredi andZs. Tuza: Hypergraphs without a large star,Discrete Mathematics
55 (1985), 317–321.
5. H. Halberstam andK. F. Roth:Sequences, Springer-Verlag, New York, 1983.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Binary subtrees with few labeled paths;Combinatorica;2011-05
2. What's the difference?;Annals of Pure and Applied Logic;1998-04
3. Difference sets and computability theory;Annals of Pure and Applied Logic;1998-04
4. Difference Sets and Recursion Theory;Mathematical Logic Quarterly;1998