| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9513464 | Discrete Mathematics | 2005 | 10 Pages |
Abstract
In particular we extend a theorem of Berge (Hypergraph Seminar, Columbus, Ohio 1972, Springer, New York, 1974, pp. 13-20.), showing that any disjoint union of at least r complete graphs, each of order at least two, is r-EKR. We also show that paths are r-EKR for all r⩾1.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Fred Holroyd, Claire Spencer, John Talbot,