Abstract
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) hamiltonian chain in H . In this paper we ask about the smallest size of an r -uniform hamiltonian path (cycle) saturated hypergraph, mainly for r = 3 . We present a construction of a family of 3-uniform path (cycle) saturated hamiltonian hypergraphs with O ( n 5 / 2 ) edges. On the other hand we prove that the number of edges in an r -uniform hamiltonian path (cycle) saturated hypergraph is at least Ω ( n r − 1 ) .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
