DM
2011
13 years 6 months ago
2011
We prove that any k-uniform hypergraph on n vertices with minimum degree at least n 2(k−1) + o(n) contains a loose Hamilton cycle. The proof strategy is similar to that used by K...
EJC
2006
13 years 11 months ago
2006
A perfect matching in a k-uniform hypergraph on n vertices, n divisible by k, is a set of n/k disjoint edges. In this paper we give a sufficient condition for the existence of a p...
CC
2006
Springer
13 years 11 months ago
2006
Springer
Given a k-uniform hypergraph, the Maximum k-Set Packing problem is to find the maximum disjoint set of edges. We prove that this problem cannot be efficiently approximated to with...
STOC
2003
ACM
14 years 4 months ago
2003
ACM
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
LION
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...