A note on kernels of intersecting families
From MaRDI portal
Publication:2277266
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.
Recommendations
Cites work
- Critical hypergraphs and interesting set-pair systems
- Finite projective spaces and intersecting hypergraphs
- Geometrical solution of an intersection problem for two hypergraphs
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 3204639 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- Interpolation of functions over a measure space and conjectures about memory
- On intersecting families of finite sets
- On the kernel of intersecting families
Cited in
(3)
This page was built for publication: A note on kernels of intersecting families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277266)