| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650600 | Discrete Mathematics | 2008 | 10 Pages |
Abstract
An r-uniform hypergraph is k-edge-hamiltonian iff it still contains a hamiltonian-chain after deleting any k edges of the hypergraph. What is the minimum number of edges in such a hypergraph? We give lower and upper bounds for this question for several values of r and k.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Péter Frankl, Gyula Y. Katona,