Abstract
A {\it weak (Berge) cycle} is an alternating sequence of vertices and (hyper)edges such that the vertices are distinct with for each , but the edges are not necessarily distinct. We prove that the main barrier to the random -uniform hypergraph where each of the potential edges of cardinality is present with probability , developing a weak Hamilton cycle is the presence of isolated vertices. In particular, for fixed and , the probability that has a weak Hamilton cycle tends to , which is also the limiting probability that has no isolated vertices. As a consequence, the probability that the random hypergraph where potential edges are chosen uniformly at random to be present, is weak Hamiltonian also tends to .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.