Greedy triple systems
暂无分享，去创建一个
We determine the number of triples in the maximal partial triple system on n elements formed by a greedy algorithm.
[1] Jiří Novák,et al. Edge Bases of Complete Uniform Hypergraphs , 1974 .
[2] Mariusz Meszka. The Chromatic Index of Projective Triple Systems , 2013 .
[3] Charles J. Colbourn,et al. The spectrum of maximal partial steiner triple systems , 1993, Des. Codes Cryptogr..