ORL
2011
13 years 7 months ago
2011
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 ...
DCC
1998
IEEE
14 years 8 days ago
1998
IEEE
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...
ARSCOM
2004
14 years 14 days ago
2004
A set of points in a Steiner triple system (STS(v)) is said to be independent if no three of these points occur in the same block. In this paper we derive for each k 8 a closed f...
JCT
2007
14 years 15 days ago
2007
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...