21 citations · 21 across the 3 of their papers we have counts for
5 papers
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…
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…
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…
Hunting Rabbits on the Hypercube
Jessalyn Bolkema, Corbin Groothuis
We explore the Hunters and Rabbits game on the hypercube. In the process, we find the solution for all classes of graphs with an isoperimetric nesting property and find the exact h…
Universal Partial Words over Non-Binary Alphabets
Bennet Goeckner, Corbin Groothuis, Cyrus Hettle +4
Chen, Kitaev, Mütze, and Sun recently introduced the notion of universal partial words, a generalization of universal words and de Bruijn sequences. Universal partial words allow f…