Sciweavers

Share
DM
2011
192views Education» more  DM 2011»
7 years 11 months ago
Loose Hamilton cycles in hypergraphs
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...
Peter Keevash, Daniela Kühn, Richard Mycroft,...
EJC
2006
8 years 4 months ago
Perfect matchings in uniform hypergraphs with large minimum degree
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...
Vojtech Rödl, Andrzej Rucinski, Endre Szemer&...
CC
2006
Springer
123views System Software» more  CC 2006»
8 years 4 months ago
On the complexity of approximating k-set packing
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...
Elad Hazan, Shmuel Safra, Oded Schwartz
STOC
2003
ACM
109views Algorithms» more  STOC 2003»
8 years 9 months ago
A new multilayered PCP and the hardness of hypergraph vertex cover
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...
Irit Dinur, Venkatesan Guruswami, Subhash Khot, Od...
LION
2007
Springer
138views Optimization» more  LION 2007»
8 years 10 months ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
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...
Samuel Rota Bulò, Marcello Pelillo
books