Name
Abstract | ||
|---|---|---|
Consider a graph G and a k-uniform hypergraph H on common vertex set [n]. We say that H is G-intersecting if for every pair of edges in X,Y ∈ H there are vertices x ∈ X and y ∈ Y such that x = y or x and y are joined by an edge in G. This notion was introduced by Bohman, Frieze, Ruszinkó and Thoma who proved a natural generalization of the Erdös-Ko-Rado Theorem for G-intersecting k-uniform hypergraphs for G sparse and k = O(n1/4). In this note, we extend this result to k = O(√n). |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0012-365X(02)00761-6 | Discrete Mathematics |
Keywords | Field | DocType |
common vertex set,g-intersecting family,g sparse,s-ko-rado theorem,k-uniform hypergraphs,k-uniform hypergraph h,graph g,natural generalization | Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Vertex (graph theory),Generalization,Constraint graph,Algebraic method,Hypergraph,Mathematics,Frieze | Journal |
Volume | Issue | ISSN |
260 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.48 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tom Bohman | 1 | 250 | 33.01 |
| Ryan R. Martin | 2 | 36 | 10.12 |