Sciweavers

TAPAS
2011
255views Algorithms» more  TAPAS 2011»
12 years 11 months ago
3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size
We study upper and lower bounds on the kernel size for the 3-hitting set problem on hypergraphs of degree at most 3, denoted 33-hs. We first show that, unless P=NP, 3-3-hs on 3-un...
Iyad A. Kanj, Fenghui Zhang
JCT
2008
92views more  JCT 2008»
13 years 4 months ago
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
Chv
Oliver Cooley, Nikolaos Fountoulakis, Daniela K&uu...