We say that a hypergraph H is hamiltonian path (cycle) saturated if H does not contain an open (closed) hamiltonian chain but by adding any new edge we create an open (closed) ham...
Using a generalisation of Hamiltonian cycles to uniform hypergraphs due to Katona and Kierstead, we define a new notion of a Hamiltonian decomposition of a uniform hypergraph. We ...
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
Abstract. We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics ...