In a Steiner triple system STS(v) = (V, B), for each pair {a, b} ⊂ V, the cycle graph G a,b can be defined as follows. The vertices of G a,b are V \ {a, b, c} where {a, b, c} ∈ B. {x, y} is an edge if either {a, x, y} or {b, x, y} ∈ B. The Steiner triple system is said to be perfect if the cycle gra
A new extremal property of Steiner triple-systems
✍ Scribed by P Frankl; Z Füredi
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 321 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
If X is a set whose elements are called points and A is a collectioxr of subsets of X (called lines) such that: (i) any two distinct points of X are contained in exactly one line, (ii) every line contains at least two points, we say that the pair (X, A) is a linear space. A Steiner triple system i
A Steiner triple system of order n (STS(n)) is said to be embeddable in an orientable surface if there is an orientable embedding of the complete graph Kn whose faces can be properly 2-colored (say, black and white) in such a way that all black faces are triangles and these are precisely the blocks
The code over a finite field F, of a design D is the space spanned by the incidence vectors of the blocks. It is shown here that if D is a Steiner triple system on v points, and if the integer then the ternary code C of contains a subcode that can be shortened to the ternary generalized Reed-Muller