8 citations · 26 across the 23 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.CO2014★ 2 cited
Necessary Spectral Conditions for Coloring Hypergraphs
Franklin H. J. Kenter
Hoffman proved that for a simple graph , the chromatic number obeys where and are the maximal and minimal eigenvalues of the…
math.CO2014
A Linear Cheeger Inequality using Eigenvector Norms
Franklin H. J. Kenter
The Cheeger constant, , is a measure of expansion within a graph. The classical Cheeger Inequality states: where is the first nontri…
math.CO2014
Bounds for the Zero-Forcing Number of Graphs with Large Girth
Randy Davila, Franklin Kenter
We investigate the zero-forcing number for triangle-free graphs. We improve upon the trivial bound, where is the minimum degree, in the triangle-free case. In parti…