Author:
Ajtai M.,Erdős P.,Komlós J.,Szemerédi E.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference6 articles.
1. M. Ajtai, J. Komlós, J. Pintz, J. Spencer andE. Szemerédi, Extremal uncrowded hypergraphs, in manuscript.
2. M. Ajtai, J. Komlós andE. Szemerédi, A dense infinite Sidon sequence,European Journal of Combinatorics,2 (1981) 1–11.
3. M. Ajtai, J. Komlós andE. Szemerédi, A note on Ramsey numbers,Journal of Combinatorial Theory A 29 (1980), 354–360.
4. J. Komlós, J. Pintz andE. Szemerédi, A lower bound for Heilbronn’s problem,Journal of the London Math. Soc., to appear.
5. J. Spencer, Turán’s theorem fork-graphs,Discrete Math. 2 (1972), 183–186.
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献