2 papers
math.CO2025
A combinatorial bound on the number of distinct eigenvalues of a graph
Sarah Allred, Craig Erickson, Kevin Grace +2
The smallest possible number of distinct eigenvalues of a graph , denoted by , has a combinatorial bound in terms of unique shortest paths in the graph. In particular, $q(…
math.CO2024
Unavoidable Induced Subgraph of Infinite 2-connected Graphs
Sarah Allred, Guoli Ding, Bogdan Oporowski
In 1930, Ramsey proved that every infinite graph contains either an infinite clique or an infinite independent set as an induced subgraph. König proved that every infinite graph c…