Kirkman triple systems (KTSs) are among the most popular combinatorial designs and their existence has been settled a long time ago. Yet, in comparison with Steiner triple systems, little is known about their automorphism groups. In particular, there is no known congruence class representing the orders of a KTS with a number of automorphisms at least close to the number of points. We partially fill this gap by proving that whenever v≡ 39 (mod 72), or v≡ 4 e48 + 3 (mod 4 e96) and e≥ 0 , there exists a KTS on v points having at least v- 3 automorphisms. This is only one of the consequences of an investigation on the KTSs with an automorphism group G acting sharply transitively on all but three points. Our methods are all constructive and yiel...
AbstractIn this paper we further discuss the embedding problem for nearly Kirkman triple systems and...
AbstractA Hanani triple system of order 6n+1, HATS(6n+1), is a decomposition of the complete graph K...
A transitive triple is a collection of three ordered pairs of the form {(a, b), (b, c), (a, c)}, whe...
Kirkman triple systems (KTSs) are among the most popular combinatorial designs and their existence h...
A Steiner triple system of order v, STS(v), together with a resolution of its blocks is called a Kir...
AbstractTwenty-eight non-isomorphic KTS(33) with an automorphism of order 11 are constructed from th...
We establish that there are exactly 500 KTS(33)s admitting an automorphism group fixing one point an...
Twenty-eight non-isomorphic KTS(33) with an automorphism of order 11 are constructed from the 84 cyc...
AbstractIn this paper, we introduce LR(u) designs and use these designs together with large sets of ...
AbstractWe study the large sets of generalized Kirkman systems. The purpose of introducing the struc...
AbstractThe purpose of this paper is to survey results on Kirkman triple systems and generalizations...
A vector space $V$ with a symmetric trilinear map $V\times V \times V \to V$ will be called a triple...
AbstractIn this paper, the existence of large sets of Kirkman triple system is transformed to the ex...
We show that there are exactly 2624 isomorphism classes of Steiner triple systems on 27 points havin...
It is well known that for any Steiner triple system (STS) one can define a binary operation · upon i...
AbstractIn this paper we further discuss the embedding problem for nearly Kirkman triple systems and...
AbstractA Hanani triple system of order 6n+1, HATS(6n+1), is a decomposition of the complete graph K...
A transitive triple is a collection of three ordered pairs of the form {(a, b), (b, c), (a, c)}, whe...
Kirkman triple systems (KTSs) are among the most popular combinatorial designs and their existence h...
A Steiner triple system of order v, STS(v), together with a resolution of its blocks is called a Kir...
AbstractTwenty-eight non-isomorphic KTS(33) with an automorphism of order 11 are constructed from th...
We establish that there are exactly 500 KTS(33)s admitting an automorphism group fixing one point an...
Twenty-eight non-isomorphic KTS(33) with an automorphism of order 11 are constructed from the 84 cyc...
AbstractIn this paper, we introduce LR(u) designs and use these designs together with large sets of ...
AbstractWe study the large sets of generalized Kirkman systems. The purpose of introducing the struc...
AbstractThe purpose of this paper is to survey results on Kirkman triple systems and generalizations...
A vector space $V$ with a symmetric trilinear map $V\times V \times V \to V$ will be called a triple...
AbstractIn this paper, the existence of large sets of Kirkman triple system is transformed to the ex...
We show that there are exactly 2624 isomorphism classes of Steiner triple systems on 27 points havin...
It is well known that for any Steiner triple system (STS) one can define a binary operation · upon i...
AbstractIn this paper we further discuss the embedding problem for nearly Kirkman triple systems and...
AbstractA Hanani triple system of order 6n+1, HATS(6n+1), is a decomposition of the complete graph K...
A transitive triple is a collection of three ordered pairs of the form {(a, b), (b, c), (a, c)}, whe...