A note on kernels of intersecting families (Q2277266)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4195952
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on kernels of intersecting families |
scientific article; zbMATH DE number 4195952 |
Statements
A note on kernels of intersecting families (English)
0 references
1990
0 references
Use \(n_ t(r)\) to denote the minimal n such that, for an r-graph F, there is an n-subset K of the vertices of F such that, for any \(\{F_ i\}\in F\) \((i=1,2,...,t)\), one has the intersection of all \(F_ i\) with K as non-null. A lower bound is obtained for this number.
0 references
0.8720100522041321
0 references
0.8047119975090027
0 references
0.7979550957679749
0 references
0.7958899736404419
0 references
0.7958897352218628
0 references
