Title of article
Extremal k-edge-hamiltonian hypergraphs Original Research Article
Author/Authors
Peter Frankl، نويسنده , , Gyula Y. Katona، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
10
From page
1415
To page
1424
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
k-Edge-hamiltonian , Hypergraph , Hamiltonian cycle
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
947225
Link To Document