Author:
Füredi Zoltán,Jiang Tao,Seiver Robert
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference29 articles.
1. M. Ajtai, J. Komlós, M. Simonovits, E. Szemerédi: The solution of the Edrős-Sós conjecture for large trees, Manuscripts.
2. B. Bollobás: Extremal graph theory, Academic Press, London, 1978.
3. M. Deza, P. Erős, P. Frankl: Intersection properties of systems of finite sets, Proc. London Math. Soc. (3) 36 (1978), 369–384.
4. P. Dorbec, S. Gravier, G. Sárközy: Monochromatic Hamiltonian t-tight Bergecycles in hypergraphs, Journal of Graph Theory 59 (2008), 34–44.
5. P. Erős, T. Gallai: On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hungar. 10 (1959), 337–356.
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献