The inequality ε_k(G) ≤ kν(G) holds for all graphs in the range 1≤k≤n(G)−2, resolving Lew's conjecture, with all equality cases characterized.
Edmonds, Paths, trees, and flowers,Canadian Journal of Mathematics, 17 (1965) 449–467
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
A Matching-Number Refinement of Brouwer's Laplacian Eigenvalue Inequality
The inequality ε_k(G) ≤ kν(G) holds for all graphs in the range 1≤k≤n(G)−2, resolving Lew's conjecture, with all equality cases characterized.