37 search results - page 4 / 8 » Independent Sets in Bounded-Degree Hypergraphs |
SIAMCOMP
2000
13 years 7 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
For every fixed 0, we give an algorithm that, given an n-vertex 3-uniform hypergraph containing an independent set of size n, finds an independent set of size n(2 ) . This improv...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
JCT
2011
13 years 2 months ago
2011
The neighborhood of a pair of vertices u, v in a triple system is the set of vertices w such that uvw is an edge. A triple system H is semi-bipartite if its vertex set contains a ...
DM
2008
13 years 7 months ago
2008
We prove that the number of minimal transversals (and also the number of maximal independent sets) in a 3-uniform hypergraph with n vertices is at most cn , where c