𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Largest size and union of Helly families

✍ Scribed by Zsolt Tuza

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
557 KB
Volume
127
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On families of finite sets with bounds o
On families of finite sets with bounds on unions and intersections
✍ Chang Bang; Henry Sharp Jr.; Peter Winkler πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 364 KB

We present a conjecture, with some supporting results, concerning the maximum size of a family of subsets satisfying the following conditions: the intersection of any two members of the family has cardinal@ at least s, and the intersection of the complements of any two members has cardinal@ at least

An upper bound on the size of the larges
An upper bound on the size of the largest cliques in a graph
✍ Alain Billionnet πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 194 KB πŸ‘ 1 views

## Abstract We produce in this paper an upper bound for the number of vertices existing in a clique of maximum cardinal. The proof is based in particular on the existence of a maximum cardinal clique that contains no vertex __x__ such that the neighborhood of __x__ is contained in the neighborhood

An upper bound on the size of a largest
An upper bound on the size of a largest clique in a graph
✍ Dennis P. Geoffroy; David P. Sumner πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 308 KB πŸ‘ 1 views

## Abstract A graph is point determining if distinct vertices have distinct neighborhoods. The nucleus of a point‐determining graph is the set __G__^O^ of all vertices, __v__, such that __G__–__v__ is point determining. In this paper we show that the size, Ο‰(__G__), of a maximum clique in __G__ sat