3 papers
math.CO2025
A Counterexample to a Conjecture of Lovász
Alexander Clow, Penny Haxell, Bojan Mohar
In 1975 Lovász conjectured that every -partite, -uniform hypergraph contains vertices whose deletion reduces the matching number. If true, this statement would imply a…
math.CO2025
Refinement of a conjecture on positive square energy of graphs
Saieed Akbari, Hitesh Kumar, Bojan Mohar +2
Let be a simple graph of order with eigenvalues . Define \[s^+(G)=\sum_{λ_i >0} λ_i^2(G), \quad s^-(G)=\sum_{λ_i<0} λ_i^2(G).\] It was conjec…
math.CO2024
On the second largest adjacency eigenvalue of trees with given diameter
Hitesh Kumar, Bojan Mohar, Shivaramakrishna Pragada +1
For a graph , let denote the second largest eigenvalue of the adjacency matrix of . We determine the extremal trees with maximum/minimum adjacency eigenvalue i…