Title of article :
Extremal k-edge-hamiltonian Hypergraphs
Author/Authors :
Prankl، نويسنده , , Péter and Katona، نويسنده , , Gyula Y. Katona، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
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 , hamiltonian cycle , Hypergraph
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
