JCT
2000
14 years 8 months ago
2000
A conjecture of V. S
JGT
2007
14 years 9 months ago
2007
A 3-uniform hypergraph is called a minimum 3-tree, if for any 3-coloring of its vertex set there is a heterochromatic triple and the hypergraph has the minimum possible number of ...
91
Voted
APPROX
2008
Springer
14 years 11 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...