Name
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 ℱ ⊆ 2[n] is G-intersecting if N(X) ∩ Y ≠ ∅ 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 | DOI | Venue |
|---|---|---|
2001 | 10.1017/S0963548301004795 | Combinatorics, Probability & Computing |
Keywords | Field | DocType |
g-intersecting families,fixed graph,vertex set,largest k-uniform g-intersecting family | Discrete mathematics,Family of sets,Graph,Combinatorics,Vertex (geometry),Cardinality,Neighbourhood (mathematics),Mathematics | Journal |
Volume | Issue | Citations |
10 | 5 | 4 |
PageRank | References | Authors |
1.20 | 1 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tom Bohman | 1 | 250 | 33.01 |
| Alan M. Frieze | 2 | 4837 | 787.00 |
| Mikló/s Ruszinkó/ | 3 | 4 | 1.20 |
| Luboš/ Thoma | 4 | 4 | 1.20 |