Hypergraph Extensions of the Erdős-Gallai Theorem
Authors:
- Ervin GyőriEGErvin Győri
- Gyula Y. KatonaGKGyula Y. Katona
- Nathan LemonsNLNathan Lemons
- 1 August 2010
- journal article
- research article
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 36, 655-662
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Monochromatic Hamiltonian t‐tight Berge‐cycles in hypergraphsJournal of Graph Theory, 2008
- Extremal k-edge-hamiltonian hypergraphsDiscrete Mathematics, 2008
- An approximate Dirac-type theorem for k-uniform hypergraphsCombinatorica, 2008
- Hamiltonian chains in hypergraphsJournal of Graph Theory, 1999
- On a Packing and Covering ProblemEuropean Journal of Combinatorics, 1985
- On maximal paths and circuits of graphsActa Mathematica Hungarica, 1959