Families of triples with high minimum degree are hamiltonian
In this paper we show that every family of triples, that is, a 3-uniform hypergraph, with minimum degree at least contains a tight Hamiltonian cycle
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2014-05-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.1743 |