Skip to main content
Article thumbnail
Location of Repository

G-intersecting Families

By Tom Bohman, Alan Frieze, Miklos Ruszinko and Lubos Thoma


Let G be a graph on vertex set [.], and for X C_ [.] let N(X) be the union of X and it's neighborhood in G. A family of sets ' C- 2 ["] is G-intersectin# if N(X) Y 0 for all X, Y '. In this paper we study the cardinality and structure of the largest k-uniform G-intersecting families on a fixed graph G

Year: 1999
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.