Author:
Nešetřil Jaroslav,Rödl Vojtěch
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory
Reference9 articles.
1. M. Aigner (1982) Problem, in: Ordered Sets (ed. I. Rival), D. Reidel, Holland, p. 819.
2. P. Erdös (1959) Graph theory and probability, Canad. J. Math. 11, 34–38.
3. M. Garey and D. Johnson (1979) Computers and Intractability, W. H. Freeman Co., San Francisco.
4. P. Holub (1985) A remark on Hasse diagrams, Order 2, 321–322.
5. J. Nešetřil and V. Rödl (1978) A probabilistic graph-theoretical method, Proc. Amer. Math. Soc. 72, 417–421.
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献