On the price of equivocation in byzantine agreement
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
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 $\left\lceil n(n-2)/3 \right\rceil$. © 2006 Wiley Periodicals, Inc. J Graph Theory 54: 103–114, 2007 Dedicated to the memory of Victor Neumann-Lara.