Name
Abstract | ||
|---|---|---|
We show that for sufficiently large n, every 3-uniform hypergraph on n vertices with minimum vertex degree at least ( n - 1 2 ) - ( ¿ 3 4 n ¿ 2 ) + c , where c = 2 if n ¿ 4 N and c = 1 if n ¿ 2 N ¿ 4 N , contains a loose Hamilton cycle. This degree condition is best possible and improves on the work of Buíß, Hí¿n and Schacht who proved the corresponding asymptotical result. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.jctb.2015.03.007 | Journal of Combinatorial Theory Series B |
Keywords | Field | DocType |
hamilton cycle | Discrete mathematics,Combinatorics,Vertex (geometry),Hamiltonian path,Constraint graph,Hypergraph,Degree (graph theory),Mathematics | Journal |
Volume | Issue | ISSN |
114 | C | 0095-8956 |
Citations | PageRank | References |
7 | 0.51 | 22 |
Authors | ||
2 | ||