3 papers
math.GR2019
Graph Immersions, Inverse Monoids, and Deck Transformations
Corbin Groothuis, John Meakin
If is a covering map between connected graphs, and is the subgroup of used to construct the cover, then it is well known that the group o…
math.CO2018
A New [Combinatorial] Proof of the Commutativity of Matching Polynomials for Cycles
Garner Cochran, Corbin Groothuis, Andrew Herring +2
We prove some functional equations involving the (classical) matching polynomials of path and cycle graphs and the -matching polynomial of a cycle graph. A matching in a (finite…
math.CO2018
Maximizing Cliques in Shellable Clique Complexes
Corbin Groothuis
In extremal graph theory, the problem of finding the elements of a given class of graphs which contain the most cliques traces its routes back to Turán's famous theorem. We conside…