𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The minimal number of basic elements in a multiset antichain

✍ Scribed by G.F. Clements

Book ID
107884880
Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
495 KB
Volume
25
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Antichains in the set of subsets of a mu
Antichains in the set of subsets of a multiset
✍ G.F Clements πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 946 KB

A set F of distinct subsets x of a finite muhiset M (that is, a set with several different kinds of elements) is a c-antichain if for no c+l elements Xo, xl ..... x c of F does XoCXlc...=xΒ’ hold. The weight of F, wF, is the total number of elements of M in the various elements x of F. For given inte

The maximum number of edges in a minimal
The maximum number of edges in a minimal graph of diameter 2
✍ ZoltΓ‘n FΓΌredi πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 717 KB

## Abstract A graph __g__ of diameter 2 is minimal if the deletion of any edge increases its diameter. Here the following conjecture of Murty and Simon is proved for __n__ < __n__~o~. If __g__ has __n__ vertices then it has at most __n__^2^/4 edges. The only extremum is the complete bipartite graph