Skip to main content
×
×
Home

A Dirac-Type Theorem for 3-Uniform Hypergraphs

  • VOJTĚCH RÖDL (a1), ANDRZEJ RUCIŃSKI (a2) and ENDRE SZEMERÉDI (a3)
Abstract

A Hamiltonian cycle in a 3-uniform hypergraph is a cyclic ordering of the vertices in which every three consecutive vertices form an edge. In this paper we prove an approximate and asymptotic version of an analogue of Dirac's celebrated theorem for graphs: for each γ>0 there exists n0 such that every 3-uniform hypergraph on $n\geq n_0$ vertices, in which each pair of vertices belongs to at least $(1/2+\gamma)n$ edges, contains a Hamiltonian cycle.

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 79 *
Loading metrics...

Abstract views

Total abstract views: 228 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 20th February 2018. This data will be updated every 24 hours.