Article contents
G-Intersecting Families
Published online by Cambridge University Press: 12 December 2001
Abstract
Let G be a graph on vertex set [n], and for X ⊆ [n] let N(X) be the union of X and its neighbourhood in G. A family of sets [Fscr ] ⊆ 2[n] is G-intersecting if N(X) ∩ Y ≠ [empty ] for all X, Y ∈ [Fscr ]. In this paper we study the cardinality and structure of the largest k-uniform G-intersecting families on a fixed graph G.
- Type
- Research Article
- Information
- Copyright
- 2001 Cambridge University Press
- 1
- Cited by