21 citations · 21 across the 3 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
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…