๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Extremal problems among subsets of a set

โœ Scribed by Paul Erdos; Daniel J. Kleitman

Publisher
Elsevier Science
Year
1974
Tongue
English
Weight
945 KB
Volume
8
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An extremal problem for antichains of su
An extremal problem for antichains of subsets of a multiset
โœ G.F. Clements ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 850 KB

A multiset M is a finite set consisting of several different kinds of elements, and an antichain F is a set of incomparable subsets of M. With P and \_F denoting respectively the set of subsets which contain an element of F or are contained in an element of F, we find the best upper bound for min(lF

Minimizer graphs for a class of extremal
Minimizer graphs for a class of extremal problems
โœ Dan Ismailescu; Dan Stefanica ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 93 KB ๐Ÿ‘ 2 views

## Abstract We consider the family of graphs with a fixed number of vertices and edges. Among all these graphs, we are looking for those minimizing the sum of the square roots of the vertex degrees. We prove that there is a unique such graph, which consists of the largest possible complete subgraph