Associate Professor Dept. of Mathematics Thompson Rivers University +1 (778) 220 6447 +1 (250) 877 6180 smcguinness@tru.ca faculty.tru.ca/smcguinness "Döda fiskar flyter med älven" (Dead fish float with the river) Swedish proverb Education 1984 1988 Ph.D, University of Waterloo, Waterloo, Ont. Mathematics 1982 1984 MS.C, Queen s University, Kingston, Ont. Mathematics 1978-1982 BS.C(Honours), Acadia University, Wolfville, NS. Mathematics Master thesis Title Supervisors The Double Cover Conjecture Dr. David Gregory Ph.D Thesis Title Supervisors Random Walks on Graphs and Digraphs Dr. Bruce Richmond Experience 2007-2010 Assistant Professor, Limited Term, Thompson Rivers University, Kamloops, BC. 2010-2011 Assistant Professor, Thompson Rivers University.
2011- Associate Professor, Thompson Rivers University. Teaching; - Taught Calculus I-IV, Discrete Math I and II, Linear and Abstract Algebra, Diff. Equations II. - Supervised reading courses in Theory of Computation (2009) and Topology (2010). Student Supervision: - Honours Theses: Chester Lipka (2008), Luc Lapierre (2013), Ben Moore (2015, co-supervision with R. Brewster). - Student Research projects: Elias Rumley (2010), Peter Harding (2011), Luc Lapierre (2012 and 2013), Ben Moore (2014, with R. Brewster), Justin Moonie (2015) Postdoctoral Supervision (with R. Brewster): - Morten Hegner Nielsen, 2010-2011. : - 16 published articles since 2005. - 10 published, 1 accepted, and 2 submitted articles since 2010. - Recipient of NSERC grants, 2008-2013, 2015-2020. Service: - Refereeing for journals - Coordinator for departmental seminars - Member of faculty of science research committee - High School math competition volunteer - Math Help Centre volunteer - Supervise students. 2006 2007 Visiting Assistant Professor, Dartmouth College, Hanover, NH. Taught courses in Vector Calculus, Combinatorics, and Statistics. 2002 2004 Assistant Professor, Adelphi University, Garden City, NY. Taught core courses for math majors and electives for non-majors (5-6 courses/year). 2001 2002 Guest Professor, University of Montana, Missoula, MT. Taught core courses (4) plus one graduate course in Matroid Theory. Helped organize combinatorics seminar. Worked as examiner for MS.C thesis. 1993 2002 Lektor, Docent, Umeå Universitet, Umeå, Sweden. Taught an array of courses (mostly in Swedish): - Calculus I-IV, linear algebra, differential equations, introductory analysis, discrete math, abstract algebra, graph theory. - Was recipient of NFR (Svenska Naturvetenskapliga Forskingsrådet) grants 1995-1998, 1998-2001. Service - Served on various committees for theses and student projects. - Served as resident "English expert" in both translating documents and proofreading.
1990 1992 Assistant Professor, limited term, University of Southern Denmark, Odense, DK. Taught courses in Probability and Statistics, Stochastic Processes, Combinatorics. 1989 1990 NATO Postdoctoral Fellowship, University of Milan / Technical University of Denmark, Italy, Denmark. Worked with Prof. W. Woess (Italy) and Prof. C. Thomassen (Denmark). Scholarships and Awards 2015 Faculty Award for Excellence in Scholarship, Thompson Rivers University. 1984 1988 NSERC Graduate Scholarship, University of Waterloo. 1982 1984 NSERC Graduate Scholarship, Queen s University. 1979 1982 Jeffery Scholarship, Acadia University. 1982 Bronze Medal in Mathematics, Acadia University. Awarded to top graduating math major Grants 2015-2020 Discovery Grant, Base Exchange and Extremal Properties in Matroids, NSERC, $11, 000/yr. 2008-2013 Discovery Grant, Cycles in Graphs and Problems Related to Matroids, NSERC, $8, 000/yr. 1998-2001 NFR Grant, Study of Cycles, Cocycles in Graphs, Colourings and Matroids, Swedish Natural Science Research Council, $15, 000(U S)/yr. 1995-1998 NFR Grant, Problems in Extremal Graph Theory, Swedish Natural Science Research Council, $15, 000(U S)/yr. Talks and Presentations June, 2015 April, 2015 March, 2014 August, 2012 June, 2012 June., 2011 Feb., 2011 CanaDAM 2015, Toric Ideals, a Conjecture of White, and a Base Exchange Property for Group Labeled Graphs, Contributed talk, Saskatoon, SK. Third BC Combinatorics Day, Hamilton Paths in the Cayley Graph of a Dihedral Group, Invited talk, Victoria, BC. West Coast Combinatorics Conference, Toric Ideals, Graphs, and Matroids, Contributed talk, Victoria, BC. Third Workshop on Graphs and Matroids, Binary Matroids with no N-Spike Minors, Contributed talk, Maastricht, Holland. International Conference on Cycles, Hamilton Circuits and Dominating Circuits in Regular Matroids, Invited talk, Nashville, TN. CanaDAM 2011, Degree Constrained Subgraphs in a Graphs, Contributed talk, Victoria, BC. 14th Coast Combinatorics Conference, Dominating Circuits in Matroids, Invited talk, Victoria, BC.
June, 2010 August, 2009 Feb., 2008 April, 2008 Jan., 2007 June, 2004 Dec., 2003 Oct., 2002 June, 2002 Sept, 2001 July, 2000 Sept, 2000 SIAM Conference in Discrete Mathematics, Dominating Circuits in Matroids, Contributed talk, Austin, TX. CMS Joint Conference with Sociedad Matematica Mexicana, A Base Exchange Property for Regular Matroids, Invited talk, Vancouver, BC. UVic Discrete Math Seminar, Perfect Path Double Covers, Matroids and a Conjecture of Hajos, Invited talk, Victoria, BC. SFU Discrete Math Seminar, Perfect Path Double Covers, Matroids and a Conjecture of Hajos, Invited talk, Vancouver, BC. 2007 AMS Meeting, Ore-type and Dirac-type Theorems for Matroids, Invited talk, New Orleans, LA. SIAM Conference on Discrete Math., Some New ideas Concerning the Double Cover Conjecture, Invited talk, Nashville, TN. CMS Winter Meeting, Sequential Transversals in Graphs and Matroids, Invited talk, Vancouver, BC. DIMACS Workshop on Geometrical Graph Theory, Bounding the Chromatic Number of the Intersection Graph of Arcwise Connected Sets, Invited talk, Rutgers, NJ. AMS Meeting, Circuits Intersecting Cocircuits in Graphs and Matroids, Invited talk, Portland, OR. Big Sky Conference on Discrete Math, Finding a Circuit Intersecting all Largest Cocircuits, Contributed talk, Missoula, MT. PIMS Workshop on Graphs and Cycles, Double Covers of Cubic Graphs of Oddness Four, Invited talk, Vancouver, BC. CNRS Conference on Discrete Math, Contractible Bonds in Graphs Without K 5 -Minors, Contributed talk, Marseilles, FR. Referee/Editorial Work 2010-2015 Referee Duties. Annals of Combinatorics, 1 paper. Combinatorica, 2 papers. Discrete Mathematics, 4 papers. Discussiones Mathematicae, 2 papers. European J. of Combinatorics, 2 papers. J. Combinatorial Theory Series B, 2 papers. J. Graph Theory, 3 papers. SIAM J. Discrete Math., 1 paper. Utilitas Mathematica, 1 paper. English Languages Fluent Swedish Fluent My swedish is currently somewhat moth-eaten, not having been used much in 14 years.
Computer skills C++, Maple, HTML, R, TeX, PostScript Interests Classical guitar, distance running, nordic skiing, photography, chess Publications Articles [1] D.A. Gregory, S. McGuinness, and W. Wallis. Clique partitions of the cocktail party graph. Discrete Math., 59:267 273, 1986. [2] N. Chakravarty, G. Holman, S. McGuinness, and A. Rescki. One-story buildings as tensegrity frame networks. Structural Topology, 12:11 18, 1986. [3] R. Rees and S. McGuinness. On the number of distinct minimal clique partitions and clique covers of line graphs. Discrete Math., 83:49 62, 1990. [4] S. McGuinness. Recurrent networks and a theorem of Nash-Williams. J. Theor. Prob., 4(1):87 100, 1991. [5] S. Markvorsen, S. McGuinness, and C. Thomassen. Transient random walks on graphs and metric spaces with applications to hyperbolic surfaces. Proc. London Math. Soc., 64(3):1 20, 1992. [6] S. McGuinness. The greedy clique decomposition of a graph. J. Graph Theory, 18(4):427 430, 1994. [7] S. McGuinness. Restricted greedy clique decompositions and greedy clique decompositions of k 4 -free graphs. Combinatorica, 14(3):321 334, 1994. [8] S. McGuinness. Greedy maximum clique decompositions. Combinatorica, 14(3):335 343, 1994. [9] S. McGuinness. Greedy clique decompositions and the Turan numbers. European Journal of Combinatorics, 16:371 380, 1995. [10] S. McGuinness. On bounding the chromatic number of L-graphs. Discrete Math., 154:179 187, 1996. [11] L. Goddyn, J. Van Den Heuvel, and S. McGuinness. Removable circuits in multigraphs. J. Combinatorial Theory, Series B, 71(2):130 143, 1997. [12] S. McGuinness. Colouring arcwise connected sets in the plane I. Graphs and Combinatorics, 16:429 439, 2000. [13] S. McGuinness. Colouring arcwise connected sets in the plane II. Graphs and Combinatorics, 17:135 148, 2000.
[14] S. McGuinness. On decomposing a graph into non-trivial bonds. J. Graph Theory, 35:109 127, 2000. [15] J. Van Den Heuvel and S. McGuinness. Coloring the square of a planar graph. J. Graph Theory, 42:110 124, 2003. [16] S. McGuinness. Contractible bonds in graphs. J. Combinatorial Theory, Series B, 93(2):207 249, 2005. [17] R. Häggkvist and S. McGuinness. Double covers of cubic graphs of oddness 4. J. Combinatorial Theory, Series B, 93(2):251 277, 2005. [18] S. McGuinness. Bonds intersecting cycles in a graph. Combinatorica, 25(4):439 450, 2005. [19] S. McGuinness. Circuits through cocircuits in a graph. Combinatorica, 25(4):451 463, 2005. [20] S. Jones and S. McGuinness. Defining matroids through sequential selection. European Journal of Combinatorics, 28:469 480, 2007. [21] S. McGuinness. Ore-type and Dirac-type theorems for matroids. J. Combinatorial Theory, Series B, 99:827 842, 2009. [22] S. McGuinness. Cycle and cocycle coverings of graphs. J. Graph Theory, 65(4):270 284, 2010. [23] S. McGuinness. A conjecture of Welsh revisited. European Journal of Combinatorics, 31:2120 2129, 2010. [24] S. McGuinness. Circuit and fractional circuit covers of matroids. European Journal of Combinatorics, 31:1335 1341, 2010. [25] S. McGuinness. An Erdős-Gallai theorem for matroids. Annals of Combinatorics, 16:107 119, 2012. [26] R. Brewster, S. McGuinness, and M. Nielsen. Factors with multiple degree constraints in graphs. Siam J. Discrete Math., 27(4):1734 1747, 2013. [27] S. McGuinness. Dominating circuits in regular matroids. Advances in Applied Mathematics, 53:72 111, 2014. [28] P. Harding and S. McGuinness. Gallai s conjecture for graphs of girth at least four. J. Graph Theory, 75(3):256 274, 2014. [29] S. McGuinness. A base exchange property for regular matroids. Journal of Combinatorial Theory, Series B, 107:42 77, 2014. [30] S. McGuinness. A bound for the growth rate of binary matroids having no PG(k-1,2)-minor. Annals of Combinatorics, 19:363 371, 2015.
[31] S. McGuinness. Binary matroids with no 4-spike minors. Discrete Math., 324:72 77, 2014. Articles Accepted for Publication [1] L. Lapierre and S. McGuinness. Constructing trees with graceful labellings using caterpillars. J. Combin. Math. Combin. Computing, page 7 pages, to appear. Submitted Articles [1] R. Brewster, S. McGuinness, B. Moore, and J. Noel. A dichotomy theorem for circular colouring reconfiguration. submitted for publication, page 21 pages, 2015. [2] S. McGuinness. Hamilton-laceability of honeycomb toroidal graphs. submitted for publication, page 22 pages, 2015. Articles in Preparation [1] S. McGuinness. The toric ideal of a gain graph. In preparation, pages >20 30 pages, 2015. Research Reports [1] S. McGuinness. Random walks on generalized lattices. Research report, Technical University of Denmark, 1989. [2] S. McGuinness and J. Stoustrup. On the generic controllability index of a timevarying structered system. Research report, Technical University of Denmark, page 11 pages, 1990. [3] S. McGuinness. Transient networks and fattenings of the line. Research Report, University of Umeå, 1992. [4] R. Häggvist and S. McGuinness. On decomposing 4-partite graphs into triangles. Research Report, University of Umeå, page 7 pages, 1993.