Grahame Erskine
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Grahame Erskine has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- James Tuite
The Open University, United Kingdom and Klaipėda University, Lithuania
14 shared publications - Terry S. Griggs
School of Mathematics and Statistics The Open University Walton Hall Milton MK7 6AA Keynes United Kingdom
9 shared publications Jozef Širáň
3 shared publications- Jozef Širáň
Open University Milton Keynes UK
3 shared publications - Robert Lewis
Department of Mathematics and Statistics The Open University Milton Keynes UK
3 shared publications Terry Griggs
3 shared publications
Latest Publications
- Open Access
- 12 September 2025
- Published by University of Primorska Press in Ars Mathematica Contemporanea
Mutually avoiding Eulerian circuits
AMC is a journal published by University of Primorska.
- 12 September 2025
- Published by University of Primorska Press in Ars Mathematica Contemporanea
Open AccessMutually avoiding Eulerian circuits
AMC is a journal published by University of Primorska.
- Open Access
- 16 June 2025
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 8 (3) , #P3.08
On bipartite (1,1,k)-mixed graphs
The Art of Discrete and Applied Mathematics (ADAM) is a modern, dynamic, platinum open access, electronic journal that will publish high-quality articles of arbitrary length in contemporary discrete and applied mathematics in which neither the authors nor the readers incur any costs.
- 16 June 2025
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 8 (3) , #P3.08
Open AccessOn bipartite (1,1,k)-mixed graphs
The Art of Discrete and Applied Mathematics (ADAM) is a modern, dynamic, platinum open access, electronic journal that will publish high-quality articles of arbitrary length in contemporary discrete and applied mathematics in which neither the authors nor the readers incur any costs.
- 27 February 2025
- Published by Wiley in Journal of Combinatorial Designs
Cycle Switching in Steiner Triple Systems of Order 19
Cycle switching is a particular form of transformation applied to isomorphism classes of a Steiner triple system of a given order (an ), yielding another . This relationship may be represented by an undirected graph. An admits cycles of lengths and . In the particular case of , it is known that the full switching graph, allowing the switching of cycles of any length, is connected. We show that if we restrict switching to only one of the possible cycle lengths, in all cases, the switching graph is disconnected (even if we ignore those s, which have no cycle of the given length). Moreover, in a number of cases we find intriguing connected components in the switching graphs, which exhibit unexpected symmetries. Our method utilizes an algorithm for determining connected components in a very large implicitly defined graph which is more efficient than previous approaches, avoiding the necessity of computing canonical labelings for a large proportion of the systems.
- 27 February 2025
- Published by Wiley in Journal of Combinatorial Designs
Cycle Switching in Steiner Triple Systems of Order 19
Cycle switching is a particular form of transformation applied to isomorphism classes of a Steiner triple system of a given order (an ), yielding another . This relationship may be represented by an undirected graph. An admits cycles of lengths and . In the particular case of , it is known that the full switching graph, allowing the switching of cycles of any length, is connected. We show that if we restrict switching to only one of the possible cycle lengths, in all cases, the switching graph is disconnected (even if we ignore those s, which have no cycle of the given length). Moreover, in a number of cases we find intriguing connected components in the switching graphs, which exhibit unexpected symmetries. Our method utilizes an algorithm for determining connected components in a very large implicitly defined graph which is more efficient than previous approaches, avoiding the necessity of computing canonical labelings for a large proportion of the systems.
- 13 January 2025
- Published by Springer Nature in European Journal of Mathematics
- Vol. 11 (1) , 1-32
On affine forestry over integral domains and families of deep Jordan–Gauss graphs
- 13 January 2025
- Published by Springer Nature in European Journal of Mathematics
- Vol. 11 (1) , 1-32
On affine forestry over integral domains and families of deep Jordan–Gauss graphs
- 15 July 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (11)
Properties of Steiner triple systems of order 21
- 15 July 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (11)
Properties of Steiner triple systems of order 21
- Open Access
Cycle switching in Steiner triple systems of order 19
Cycle switching is a particular form of transformation applied to isomorphism classes of a Steiner triple system of a given order $v$ (an $STS(v)$), yielding another $STS(v)$. This relationship may be represented by an undirected graph. An $STS(v)$ admits cycles of lengths $4,6,\ldots,v-7$ and $v-3$. In the particular case of $v=19$, it is known that the full switching graph, allowing switching of cycles of any length, is connected. We show that if we restrict switching to only one of the possible cycle lengths, in all cases the switching graph is disconnected (even if we ignore those $STS(19)$s which have no cycle of the given length). Moreover, in a number of cases we find intriguing connected components in the switching graphs which exhibit unexpected symmetries. Our method utilises an algorithm for determining connected components in a very large implicitly defined graph which is more efficient than previous approaches, avoiding the necessity of computing canonical labellings for a large proportion of the systems.Open AccessCycle switching in Steiner triple systems of order 19
Cycle switching is a particular form of transformation applied to isomorphism classes of a Steiner triple system of a given order $v$ (an $STS(v)$), yielding another $STS(v)$. This relationship may be represented by an undirected graph. An $STS(v)$ admits cycles of lengths $4,6,\ldots,v-7$ and $v-3$. In the particular case of $v=19$, it is known that the full switching graph, allowing switching of cycles of any length, is connected. We show that if we restrict switching to only one of the possible cycle lengths, in all cases the switching graph is disconnected (even if we ignore those $STS(19)$s which have no cycle of the given length). Moreover, in a number of cases we find intriguing connected components in the switching graphs which exhibit unexpected symmetries. Our method utilises an algorithm for determining connected components in a very large implicitly defined graph which is more efficient than previous approaches, avoiding the necessity of computing canonical labellings for a large proportion of the systems. - Open Access
Properties of Steiner triple systems of order 21
Properties of the 62,336,617 Steiner triple systems of order 21 with a non-trivial automorphism group are examined. In particular, there are 28 which have no parallel class, six that are 4-chromatic, five that are 3-balanced, 20 that avoid the mitre, 21 that avoid the crown, one that avoids the hexagon and two that avoid the prism. All systems contain the grid. None have a block intersection graph that is 3-existentially closed.
Open AccessProperties of Steiner triple systems of order 21
Properties of the 62,336,617 Steiner triple systems of order 21 with a non-trivial automorphism group are examined. In particular, there are 28 which have no parallel class, six that are 4-chromatic, five that are 3-balanced, 20 that avoid the mitre, 21 that avoid the crown, one that avoids the hexagon and two that avoid the prism. All systems contain the grid. None have a block intersection graph that is 3-existentially closed.
- 1 January 2024
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 44 (3) , 1169-1188
On the vertex position number of graphs
- 1 January 2024
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 44 (3) , 1169-1188
On the vertex position number of graphs
- Open Access
Mutually avoiding Eulerian circuits
Two Eulerian circuits, both starting and ending at the same vertex, are avoiding if at every other point of the circuits they are at least distance 2 apart. An Eulerian graph which admits two such avoiding circuits starting from any vertex is said to be doubly Eulerian. The motivation for this definition is that the extremal Eulerian graphs, i.e. the complete graphs on an odd number of vertices and the cycles, are not doubly Eulerian. We prove results about doubly Eulerian graphs and identify those that are the `densest' and `sparsest' in terms of the number of edges.
Open AccessMutually avoiding Eulerian circuits
Two Eulerian circuits, both starting and ending at the same vertex, are avoiding if at every other point of the circuits they are at least distance 2 apart. An Eulerian graph which admits two such avoiding circuits starting from any vertex is said to be doubly Eulerian. The motivation for this definition is that the extremal Eulerian graphs, i.e. the complete graphs on an odd number of vertices and the cycles, are not doubly Eulerian. We prove results about doubly Eulerian graphs and identify those that are the `densest' and `sparsest' in terms of the number of edges.
- Open Access
- 20 February 2023
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 39 (2) , 1-17
Turán Problems for k-Geodetic Digraphs
A digraph G is k-geodetic if for any pair of (not necessarily distinct) vertices $$u,v \in V(G)$$ there is at most one walk of length $$\le k$$ from u to v in G. In this paper, we determine the largest possible size of a k-geodetic digraph with a given order. We then consider the more difficult problem of the largest size of a strongly-connected k-geodetic digraph with a given order, solving this problem for $$k = 2$$ and giving a construction which we conjecture to be extremal for larger k. We close with some results on generalised Turán problems for the number of directed cycles and paths in k-geodetic digraphs.- 20 February 2023
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 39 (2) , 1-17
Open AccessTurán Problems for k-Geodetic Digraphs
A digraph G is k-geodetic if for any pair of (not necessarily distinct) vertices $$u,v \in V(G)$$ there is at most one walk of length $$\le k$$ from u to v in G. In this paper, we determine the largest possible size of a k-geodetic digraph with a given order. We then consider the more difficult problem of the largest size of a strongly-connected k-geodetic digraph with a given order, solving this problem for $$k = 2$$ and giving a construction which we conjecture to be extremal for larger k. We close with some results on generalised Turán problems for the number of directed cycles and paths in k-geodetic digraphs.