Sciweavers

10 search results - page 1 / 2
» Independent sets in Steiner triple systems
Sort
View
112
Voted
ARSCOM
2004
76views more  ARSCOM 2004»
15 years 3 months ago
Independent sets in Steiner triple systems
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...
A. D. Forbes, Mike J. Grannell, Terry S. Griggs
DCC
2002
IEEE
16 years 3 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...
100
Voted
JCT
2007
83views more  JCT 2007»
15 years 3 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
121
Voted
ORL
2011
14 years 10 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...
129
Voted
JCT
2011
101views more  JCT 2011»
14 years 10 months ago
Almost all triple systems with independent neighborhoods are semi-bipartite
The neighborhood of a pair of vertices u, v in a triple system is the set of vertices w such that uvw is an edge. A triple system H is semi-bipartite if its vertex set contains a ...
József Balogh, Dhruv Mubayi