Sciweavers

JGT
2007
69views more  JGT 2007»
14 years 11 days ago
The size of minimum 3-trees
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 ...
Jorge L. Arocha, Joaquín Tey