On partial parallel classes in partial Steiner triple systems
نویسندگان
چکیده
For an integer ρ such that 1≤ρ≤v∕3, define β(ρ,v) to be the maximum number of blocks in any partial Steiner triple system on v points which parallel class has size ρ. We obtain lower bounds by giving explicit constructions, and upper result from counting arguments. show β(ρ,v)∈Θ(v) if is a constant, β(ρ,v)∈Θ(v2) ρ=v∕c, where c constant. When our differ constant depends Finally, we apply results infinite classes sequenceable systems.
منابع مشابه
Embedding Partial Steiner Triple Systems
We prove that a partial Steiner triple system 8 of order n can be embedded in a Steiner triple system T of any given admissible order greater than 4w. Furthermore, if G(S), the missing-edge graph of S, has the property that A(G)<ri(n + l)l and \E(G)\ then # can be embedded in a Steiner triple system of order 2n +1, provided that 2w +1 is admissible. We also prove that if there is a partial Stei...
متن کاملSteiner Triple Systems without Parallel Classes
A Steiner triple system of order v (or STS(v)) is a pair (V,B) such that V is a v-set and B is a set of 3-subsets of V (called triples) such that each pair of elements of V occurs in exactly one triple in B. Such a system exists if and only if v ≡ 1 or 3 (mod 6). A parallel class of an STS(6k + 3) is a set of 2k + 1 disjoint triples in the system, and an almost parallel class of an STS(6k + 1) ...
متن کاملEmbedding partial Steiner triple systems so that their automorphisms extend
It is shown that there is a function g on the natural numbers such that a partial Steiner triple system U on u points can be embedded in a Steiner triple system V on v points, in such a way that all automorphisms of U can be extended to V , for every admissible v satisfying v > g(u). We find exponential upper and lower bounds for g.
متن کاملStar chromatic numbers of hypergraphs and partial Steiner triple systems
The concept of star chromatic number of a graph, introduced by Vince (1988) is a natural generalization of the chromatic number of a graph. This concept was studied from a pure combinatorial point of view by Bondy and Hell (1990). In this paper we introduce strong and weak star chromatic numbers of uniform hypergraphs and study their basic properties. In particular, we focus on partial Steiner ...
متن کاملComplementary partial resolution squares for Steiner triple systems
In this paper, we introduce a generalization of frames called partial resolution squares. We are interested in constructing sets of complementary partial resolution squares for Steiner triple systems. Our main result is the existence of six complementary partial resolution squares for Steiner triple systems of order v which can be superimposed in a v × v array so that the resulting array is als...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2020.112279