The size of minimum 3‐trees |
| |
| Authors: | Jorge L. Arocha Joaquín Tey |
| |
| Affiliation: | 1. Instituto de Matemáticas, Unam Ciudad Universitaria, Circuito Exterior, México D.F. 04510;2. Departamento de Matemáticas, Uam‐Iztapalapa Ave. Sn. Rafael Atlixco #186, Col. Vicentina, México D.F. 09340 |
| |
| Abstract: | A 3‐uniform hypergraph (3‐graph) is said to be tight, if for any 3‐partition of its vertex set there is a transversal triple. We give the final steps in the proof of the conjecture that the minimum number of triples in a tight 3‐graph on n vertices is exactly  . © 2006 Wiley Periodicals, Inc. J Graph Theory 54: 103–114, 2007 |
| |
| Keywords: | tight hypergraphs triple systems triangulated surfaces |
|
|
