Brian Alspach

Last updated

Brian Roger Alspach is a mathematician whose main research interest is in graph theory. Alspach has also studied the mathematics behind poker, and writes for Poker Digest and Canadian Poker Player magazines.

Contents

Biography

Brian Alspach was born on May 29, 1938, in North Dakota. He attended the University of Washington from 1957 to 1961, receiving his B.A. in 1961. He taught at a junior high school for one year before beginning his graduate studies. In 1964 he received his master's degree and in 1966 he obtained his Ph.D. from the University of California, Santa Barbara under the supervision of Paul Kelly. [1] He taught at Simon Fraser University for 33 years. He retired from there in 1998. He currently works as an adjunct professor at the University of Regina and has been there since 1999. He is responsible for creating an industrial mathematics degree at Simon Fraser University. [2]

Brian Alspach believes that the growth and future of mathematics will depend on the business people in the industrial businesses. [3] His interests are in graph theory and its applications. One of his theories of coverings and decomposition has been applied to scheduling issues that can arise in the business world. Alspach states that his biggest issue with this is trying to explain such complex math to people in the business world with only a basic understanding of math. He has mentored a total of 13 Ph.D. students. His wife is the former vice president of academics at the University of Regina where he was an adjunct professor. [4] Brian is currently employed as conjoint professor at the University of Newcastle. [5]

Research

One of his first publications was an article titled Cycles of each length in regular tournaments, which was published in the Canadian Mathematical Bulletin (November, 1967). [6]

Another influential piece of Brian Alspach is Point-symmetric graphs and digraphs of prime order and transitive permutation groups of prime degree, which was published in the Journal of Combinatorial Theory (August, 1973). [7]

In his article titled Isomorphism of circulant graphs and digraphs which was published in Discrete Mathematics (February, 1979). [8] He discusses the isomorphism problem for a special class of graphs.

Brian Alspach coauthored an article with T. D. Parsons titled A construction for vertex –transitive graph published in the Canadian Journal of Mathematics (April, 1982). [9]

Alspach's conjecture, posed by Alspach in 1981, concerns the characterization of disjoint cycle covers of complete graphs with prescribed cycle lengths. With Heather Gavlas Jordon, in 2001, Alspach proved a special case, on the decomposition of complete graphs into cycles that all have the same length. This is possible if and only if the complete graph has an odd number of vertices (so its degree is even), the given cycle length is at most the number of vertices (so that cycles of that length exist), and the given length divides the number of edges of the graph. [10] A proof of the full conjecture was published in 2014. [11]

Related Research Articles

<span class="mw-page-title-main">Dragan Marušič</span> Slovenian mathematician

Dragan Marušič is a Slovene mathematician. Marušič obtained his BSc in technical mathematics from the University of Ljubljana in 1976, and his PhD from the University of Reading in 1981 under the supervision of Crispin Nash-Williams.

In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between edges of G. L(G) is constructed in the following way: for each edge in G, make a vertex in L(G); for every two edges in G that have a vertex in common, make an edge between their corresponding vertices in L(G).

<span class="mw-page-title-main">Circulant graph</span> Undirected graph acted on by a vertex-transitive cyclic group of symmetries

In graph theory, a circulant graph is an undirected graph acted on by a cyclic group of symmetries which takes any vertex to any other vertex. It is sometimes called a cyclic graph, but this term has other meanings.

In graph theory, the Lovász conjecture (1969) is a classical problem on Hamiltonian paths in graphs. It says:

<span class="mw-page-title-main">Paley graph</span>

In mathematics, Paley graphs are dense undirected graphs constructed from the members of a suitable finite field by connecting pairs of elements that differ by a quadratic residue. The Paley graphs form an infinite family of conference graphs, which yield an infinite family of symmetric conference matrices. Paley graphs allow graph-theoretic tools to be applied to the number theory of quadratic residues, and have interesting properties that make them useful in graph theory more generally.

In graph theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order. Comparability graphs have also been called transitively orientable graphs, partially orderable graphs, containment graphs, and divisor graphs. An incomparability graph is an undirected graph that connects pairs of elements that are not comparable to each other in a partial order.

<span class="mw-page-title-main">Möbius ladder</span> Cycle graph with all opposite nodes linked

In graph theory, the Möbius ladderMn, for even numbers n, is formed from an n-cycle by adding edges connecting opposite pairs of vertices in the cycle. It is a cubic, circulant graph, so-named because (with the exception of M6, Mn has exactly n/2 four-cycles which link together by their shared edges to form a topological Möbius strip. Möbius ladders were named and first studied by Guy and Harary .

In graph theory, a branch of mathematics, a skew-symmetric graph is a directed graph that is isomorphic to its own transpose graph, the graph formed by reversing all of its edges, under an isomorphism that is an involution without any fixed points. Skew-symmetric graphs are identical to the double covering graphs of bidirected graphs.

William Lawrence Kocay is a Canadian professor at the department of computer science at St. Paul's College of the University of Manitoba and a graph theorist. He is known for his work in graph algorithms and the reconstruction conjecture and is affectionately referred to as "Wild Bill" by his students. Bill Kocay is a former managing editor of Ars Combinatoria, a Canadian journal of combinatorial mathematics, is a founding fellow of the Institute of Combinatorics and its Applications.

<span class="mw-page-title-main">Hypohamiltonian graph</span> Type of graph in graph theory

In the mathematical field of graph theory, a graph G is said to be hypohamiltonian if G itself does not have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian.

<span class="mw-page-title-main">Star (graph theory)</span> Tree graph with one central node and leaves of length 1

In graph theory, a starSk is the complete bipartite graph K1,k : a tree with one internal node and k leaves. Alternatively, some authors define Sk to be the tree of order k with maximum diameter 2; in which case a star of k > 2 has k − 1 leaves.

<span class="mw-page-title-main">Generalized Petersen graph</span> Family of cubic graphs formed from regular and star polygons

In graph theory, the generalized Petersen graphs are a family of cubic graphs formed by connecting the vertices of a regular polygon to the corresponding vertices of a star polygon. They include the Petersen graph and generalize one of the ways of constructing the Petersen graph. The generalized Petersen graph family was introduced in 1950 by H. S. M. Coxeter and was given its name in 1969 by Mark Watkins.

<span class="mw-page-title-main">Hamiltonian decomposition</span>

In graph theory, a branch of mathematics, a Hamiltonian decomposition of a given graph is a partition of the edges of the graph into Hamiltonian cycles. Hamiltonian decompositions have been studied both for undirected graphs and for directed graphs. In the undirected case a Hamiltonian decomposition can also be described as a 2-factorization of the graph such that each factor is connected.

<span class="mw-page-title-main">Half-transitive graph</span>

In the mathematical field of graph theory, a half-transitive graph is a graph that is both vertex-transitive and edge-transitive, but not symmetric. In other words, a graph is half-transitive if its automorphism group acts transitively upon both its vertices and its edges, but not on ordered pairs of linked vertices.

In graph theory, a cycle decomposition is a decomposition into cycles. Every vertex in a graph that has a cycle decomposition must have even degree.

<span class="mw-page-title-main">Pancyclic graph</span>

In the mathematical study of graph theory, a pancyclic graph is a directed graph or undirected graph that contains cycles of all possible lengths from three up to the number of vertices in the graph. Pancyclic graphs are a generalization of Hamiltonian graphs, graphs which have a cycle of the maximum possible length.

<span class="mw-page-title-main">Italo Jose Dejter</span>

Italo Jose Dejter is an Argentine-born American mathematician, a retired professor of mathematics and computer science from the University of Puerto Rico, and a researcher in algebraic topology, differential topology, graph theory, coding theory and combinatorial designs. He obtained a Licentiate degree in mathematics from University of Buenos Aires in 1967, arrived at Rutgers University in 1970 by means of a Guggenheim Fellowship and obtained a Ph.D. degree in mathematics in 1975 under the supervision of Professor Ted Petrie, with support of the National Science Foundation. He was a professor at the Federal University of Santa Catarina, Brazil, from 1977 to 1984, with grants from the National Council for Scientific and Technological Development, (CNPq).

Alspach's conjecture is a mathematical theorem that characterizes the disjoint cycle covers of complete graphs with prescribed cycle lengths. It is named after Brian Alspach, who posed it as a research problem in 1981. A proof was published by Darryn Bryant, Daniel Horsley, and William Pettersson (2014).

<span class="mw-page-title-main">Oberwolfach problem</span>

The Oberwolfach problem is an unsolved problem in mathematics that may be formulated either as a problem of scheduling seating assignments for diners, or more abstractly as a problem in graph theory, on the edge cycle covers of complete graphs. It is named after the Oberwolfach Research Institute for Mathematics, where the problem was posed in 1967 by Gerhard Ringel. It is known to be true for all sufficiently-large complete graphs.

Katherine A. Heinrich is a mathematician and mathematics teacher who wasthe first female president of the Canadian Mathematical Society. Her research interests include graph theory and the theory of combinatorial designs. Originally from Australia, she moved to Canada where she worked as a professor at Simon Fraser University and as an academic administrator at the University of Regina.

References

  1. ↑ Brian Alspach at the Mathematics Genealogy Project
  2. ↑ http://www.mathcentral.uregina.ca/humanface/career/profiles/brianalspach.pdf%5B%5D
  3. ↑ http://mathcentral.uregina.ca/humanface/careers/profiles/brianalspach.pdf%5B%5D%5B%5D
  4. ↑ Morris, Joy; Šajna, Mateja (2005). "Brian Alspach and his work". Discrete Mathematics . 299 (1–3): 269–287. CiteSeerX   10.1.1.86.8422 . doi:10.1016/j.disc.2005.03.024.
  5. ↑ "Staff Profile". www.newcastle.edu.au. 2015-01-16. Retrieved 2019-09-12.
  6. ↑ Alspach, Brian (June 1967). "Cycles of Each Length in Regular Tournaments". Canadian Mathematical Bulletin . 10 (2): 283–286. doi: 10.4153/CMB-1967-028-6 .
  7. ↑ Alspach, Brian (1973). "Point-symmetric graphs and digraphs of prime order and transitive permutation groups of prime degree". Journal of Combinatorial Theory . Series B. 15 (1): 12–7. doi: 10.1016/0095-8956(73)90027-0 .
  8. ↑ Alspach, Brian; Parsons, T. D. (1979). "Isomorphism of circulant graphs and digraphs". Discrete Mathematics . 25 (2): 97–108. doi: 10.1016/0012-365X(79)90011-6 .
  9. ↑ Alspach, Brian; Parsons, T. D. (1982). "A construction for vertex–transitive graphs". Canadian Journal of Mathematics. 34 (2): 307–318. doi: 10.4153/cjm-1982-020-8 . S2CID   14128355.
  10. ↑ Alspach, Brian; Gavlas, Heather (2001). "Cycle Decompositions of Kn and Kn−I". Journal of Combinatorial Theory . Series B. 81: 77–99. doi: 10.1006/jctb.2000.1996 .
  11. ↑ Bryant, Darryn; Horsley, Daniel; Pettersson, William (2014). "Cycle decompositions V: Complete graphs into cycles of arbitrary lengths". Proceedings of the London Mathematical Society. Third Series. 108 (5): 1153–1192. arXiv: 1204.3709 . doi:10.1112/plms/pdt051. MR   3214677. S2CID   40046099.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.