论文信息 - An inequality for the sizes of prime filters of finite distributive lattices - 字舞流文

An inequality for the sizes of prime filters of finite distributive lattices

Dwight Duffus | Bill Sands | D. Duffus | B. Sands

[1] Piotr Wójcik,et al. Union-closed families of sets , 1999, Discret. Math..

[2] Robert T. Johnson,et al. On Union-Closed Families, I , 1999, J. Comb. Theory, Ser. A.

[3] Tetsuya Abe,et al. Frankl's Conjecture is True for Modular Lattices , 1998, Graphs Comb..

[4] M. El-Zahar. A graph-theoretic version of the union-closed sets conjecture , 1997, J. Graph Theory.

[5] E. Knill. Graph generated union-closed families of sets , 1994, math/9409215.

[6] Wilfried Imrich,et al. The Average Size of Nonsingular Sets in a Graph , 1993 .

[7] Piotr Wójcik,et al. Density of union-closed families , 1992, Discret. Math..

[8] Andre Michelle Lubecke. Which Mean Do You Mean , 1991 .

[9] Michael E. Saks,et al. Every Poset Has a Central Element , 1985, J. Comb. Theory, Ser. A.

[10] I. Rival. Graphs and Order , 1985 .

[11] Bill Sands. Counting antichains in finite partially ordered sets , 1981, Discret. Math..