The size of k-pseudotrees
暂无分享,去创建一个
Abstract Let X be a finite set. A k-pseudotree on X is a family F of subsets of X such that: (i) X ϵ F and for every xϵ X, {x} ϵ F ; (ii) for every U ϵ F there exists an xϵU such that if V ϵ F and x ϵ V, then V is comparable to U; (iii) the intersection of k + 1 pairwise incomparable members of F is empty. The covering graphs of the 1-pseudotrees on an n-set (considered as posets under inclusion) are the directed rooted trees with n leaves and no vertex of outdegree one. It is shown that if k
[1] A. Dewdney. Higher-dimensional tree structures , 1974 .
[2] Earl Glen Whitehead. Chromatic polynomials of generalized trees , 1988, Discret. Math..
[3] Miklós Simonovits,et al. Intersection Theorems on Structures , 1980 .
[4] David S. Johnson,et al. The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.
[5] Emanuel Knill. Generalized degrees and densities for families of sets , 1994 .