On hamiltonian chain saturated uniform hypergraphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2012

On hamiltonian chain saturated uniform hypergraphs

Abstract

We say that a hypergraph H is hamiltonian chain saturated if H does not contain a hamiltonian chain but by adding any new edge we create a hamiltonian chain in H. In this paper we ask about the smallest size of a k-uniform hamiltonian chain saturated hypergraph. We present a construction of a family of k-uniform hamiltonian chain saturated hypergraphs with O(n(k-1/2)) edges.
Fichier principal
Vignette du fichier
1522-6732-1-PB.pdf (254.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00990568 , version 1 (13-05-2014)

Identifiers

Cite

Aneta Dudek, Andrzej Zak. On hamiltonian chain saturated uniform hypergraphs. Discrete Mathematics and Theoretical Computer Science, 2012, Vol. 14 no. 1 (1), pp.21-28. ⟨10.46298/dmtcs.571⟩. ⟨hal-00990568⟩

Collections

TDS-MACS
88 View
1213 Download

Altmetric

Share

Gmail Facebook X LinkedIn More