Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference11 articles.
1. Asymptotic enumeration of partial orders on a finite set;Kleitman;Trans. Amer. Math. Soc.,1975
2. A counterexample about poset reconstruction;Kratsch;Order,1994
3. Towards the reconstruction of posets;Kratsch;Order,1994
4. Width two posets are reconstructible;Kratsch;Discrete Math.,1996
5. J.-X. Rampon, What is reconstruction for ordered sets?, in: Proceedings of the Fraïssé 2000 Conference, 2001.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献