P.C. Denny, "Search and Enumeration Techniques for Incidence Structures", M.Sc. Thesis, Computer Science, University of Auckland, 1998. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Weakly Union-free Maximum Packings - Colbourn (1998) (Correct)
....most j n(n Gamma1) 3 k hyperedges. Equality occurs when all, or all but one, pair of vertices occur in two hyperedges each. Chee, Colbourn, and Ling [6] establish that equality is met for all n j 0; 1 (mod 3) with a small number of definite, and a small number of possible, exceptions. Denny [7] eliminated the possible exception when n = 12 by computational search. Theorem 1.2. A wuf TTS(n) exists whenever n j 0; 1 (mod 3) except when n 2 f3; 4; 6; 7; 9; 10; 12g and possibly when n 2 f15; 18; 22g. Weakly Union free Maximum Packings 3 Theorem 1.1 also admits the possibility that n j 2 ....
P.C. Denny, "Search and Enumeration Techniques for Incidence Structures", M.Sc. Thesis, Computer Science, University of Auckland, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC