2 citations · 5 across the 8 of their papers we have counts for
11 papers
Small transitive homogeneous - designs
M. Epstein, D. L. Kreher, S. S. Magliveras
A - design is a configuration of points and a collection of - and -element subsets called blocks, that jointly contain every 3-element subset exactly on…
A simple proof for the chromatic number of cyclic Latin squares of even order
Zahra Naghdabadi
The chromatic number of a cyclic Latin square of order 2n is 2n+2. The available proof for this statement includes a coloring that is rather lengthy. Here, we introduce a coloring…
Block-avoiding point sequencings of Mendelsohn triple systems
Donald L. Kreher, Douglas R. Stinson, Shannon Veitch
A cyclic ordering of the points in a Mendelsohn triple system of order (or MTS) is called a sequencing. A sequencing is -good if there does not exist a triple $(…
Good sequencings for small Mendelsohn triple systems
Donald L. Kreher, Douglas R. Stinson, Shannon Veitch
A Mendelsohn triple system of order (or MTS) is a decomposition of the complete graph into directed 3-cyles. We denote the directed 3-cycle with edges , and…
Block-avoiding point sequencings of directed triple systems
Donald L. Kreher, Douglas R. Stinson, Shannon Veitch
A directed triple system of order (or, DTS) is decomposition of the complete directed graph into transitive triples. A -good sequencing of a DTS is a p…
Sequencing Partial Steiner Triple Systems
Brian Alspach, Donald L. Kreher, Adrián Pastine
A partial Steiner triple system of order n is sequenceable if there is a sequence of length n of its distinct points such that no proper segment of the sequence is a union of point…
Good sequencings for small directed triple systems
Donald L. Kreher, Douglas R. Stinson, Shannon Veitch
A directed triple system of order (or, DTS) is a decomposition of the complete directed graph into transitive triples. An -good sequencing of a DTS…
Nonsequenceable Steiner triple systems
Donald L. Kreher, Douglas R. Stinson
A partial Steiner triple system is is if the points can be sequenced so that no proper segment can be partitioned into blocks. We show that, if $0 \leq a \leq (n-1)/…
New Bounds on the Biplanar Crossing Number of Low-dimensional Hypercubes
Gregory Clark, Gwen Spencer
In this note we provide an improved upper bound on the biplanar crossing number of the 8-dimensional hypercube. The -planar crossing number of a graph is the number of…
Technical report Existence of Kirkman signal sets on points,
Melissa S. Keranen, Donald L. Kreher
A partial Steiner triple system whose triples can be partitioned into partial parallel classes, each of size , is a , denoted $\mbox{SS}(v,s,m)$. A $…
A note on nearly platonic graphs
Dalibor Froncek, William J. Keith, Donald L. Kreher
A nearly platonic graph is a k-regular simple planar graph in which all but a small number of the faces have the same degree. We show that it is impossible for a finite graph to ha…