Sciweavers

12 search results - page 1 / 3
» On 6-sparse Steiner triple systems
Sort
View
JCT
2007
83views more  JCT 2007»
13 years 4 months ago
On 6-sparse Steiner triple systems
We give the first known examples of 6-sparse Steiner triple systems by constructing 29 such systems in the residue class 7 modulo 12, with orders ranging from 139 to 4447. We the...
A. D. Forbes, Mike J. Grannell, Terry S. Griggs
ORL
2011
12 years 11 months ago
Solving large Steiner Triple Covering Problems
Computing the 1-width of the incidence matrix of a Steiner Triple System gives rise to small set covering instances that provide a computational challenge for integer programming ...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
COMBINATORICS
1999
113views more  COMBINATORICS 1999»
13 years 4 months ago
Bicoloring Steiner Triple Systems
A Steiner triple system has a bicoloring with m color classes if the points are partitioned into m subsets and the three points in every block are contained in exactly two of the ...
Charles J. Colbourn, Jeffrey H. Dinitz, Alexander ...
DCC
2002
IEEE
14 years 4 months ago
On Large Sets of v-1 L-Intersecting Steiner Triple Systems of Order v
F. Franek, Mike J. Grannell, Terry S. Griggs, Alex...
DCC
1998
IEEE
13 years 4 months ago
Caps and Colouring Steiner Triple Systems
Hill [6] showed that the largest cap in PG(5, 3) has cardinality 56. Using this cap it is easy to construct a cap of cardinality 45 in AG(5, 3). Here we show that the size of a cap...
Aiden A. Bruen, Lucien Haddad, David L. Wehlau