Author:
Ajtai M.,Komlós J.,Szemerédi E.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference5 articles.
1. M. Ajtai, J. Komlós andE. Szemerédi, The longest path in a random graph,Combinatorica 1 (1981) 1–12.
2. P. Erdős andJ. Spencer. Evolution of the n-cube,Computers and Math. with Applications 5 (1979) 33–40.
3. L. H. Harper, Optimal numberings and isoperimetric problems on graphs,Journal of Comb. Th. 1 (1966) 358–394.
4. T. E. Harris,The theory of branching processes, Springer (1963).
5. J. Komlós, M. Sulyok andE. Szemerédi. Underdogs in a random graph,submitted to Studia Sci. Math. Hung.
Cited by
84 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献