Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory
Reference12 articles.
1. B.Bollobas (1985) Random Graphs, Academic Press, London.
2. K. J.Compton (1988) The computational complexity of asymptotic problems. I: Partial orders, Inform. and Computation 78, 103?123.
3. D.Duffus and P.Winkler (1990) On the number of k-realizations of an ordered set, Order 7, 267?273.
4. B.Dushnik and E. W.Miller (1941) Partially ordered sets, Amer. J. Math. 63, 600?610.
5. M. El-Zahar and N. W. Sauer (1987), Asymptotic enumeration of two-dimensional posets, U. of Calgary Dept. of Mathematics and Statistics, Research Paper No. 643.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献