Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs

Buss, Enno; Han, Hiep; Schacht, Mathias

Advanced search

Search - Use quotation marks to get a more specific result

Index

Field of knowledge

Start date

Betweenand

(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs

Full text
Author(s):	Buss, Enno ^[1] ; Han, Hiep ^[1] ; Schacht, Mathias ^[1] Total Authors: 3
Affiliation:	^[1] Univ Hamburg, Fachbereich Math, D-20146 Hamburg - Germany Total Affiliations: 1
Document type:	Journal article
Source:	JOURNAL OF COMBINATORIAL THEORY SERIES B; v. 103, n. 6, p. 658-678, NOV 2013.
Web of Science Citations:	13
Abstract
We investigate minimum vertex degree conditions for 3-uniform hypergraphs which ensure the existence of loose Hamilton cycles. A loose Hamilton cycle is a spanning cycle in which only consecutive edges intersect and these intersections consist of precisely one vertex. We prove that every 3-uniform n-vertex (n even) hypergraph H with minimum vertex degree delta(1)(H) >= (7/16 + o(1))((n)(2)) contains a loose Hamilton cycle. This bound is asymptotically best possible. (C) 2013 Elsevier Inc. All rights reserved. (AU)

FAPESP's process:	10/16526-3 - Quasi-random hypergraphs and spanning subhypergraph containment
Grantee:	Hiep Han
Support Opportunities:	Scholarships in Brazil - Post-Doctoral

Short URL