1097-0118/asset/cover.gif?v=1&s=747ee645df081de59c78864878c8bdb9daeca9a1 "Journal of Graph Theory")
Dedicated to the memory of Victor Neumann-Lara.
1097-0118/asset/JGT_left.gif?v=1&s=1444a0be416c8f041967dd96201bc2e34f807002)
The size of minimum 3-trees†
Article first published online: 5 SEP 2006
DOI: 10.1002/jgt.20197
Copyright © 2006 Wiley Periodicals, Inc.
Additional Information
How to Cite
Arocha, J. L. and Tey, J. (2007), The size of minimum 3-trees. J. Graph Theory, 54: 103–114. doi: 10.1002/jgt.20197
- †
Publication History
- Issue published online: 8 DEC 2006
- Article first published online: 5 SEP 2006
- Manuscript Revised: 26 MAY 2006
- Manuscript Received: 9 JUL 2004
Funded by
- CONACYT-U41340-F and DGAPA-IN111702-3 (partially supported; to J. L. A.)
- Abstract
- References
- Cited By
Keywords:
- tight hypergraphs;
- triple systems;
- triangulated surfaces
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