3 papers
math.CO2026
A note on matchings and co-matchings in bipartite graphs
Sida Li
A class of bipartite graphs is said to have the strong ErdÅs-Hajnal property if there exists such that every graph in the class contains a complete…
math.CO2026
On graphs with large third eigenvalue
Giacomo Leonida, Sida Li
Given a graph , let denote the third largest eigenvalue of its adjacency matrix. In this paper, we prove various results towards the conjecture that $λ_3(G) \le \frac{|V…
math.CO2025
Strengthened upper bound on the third eigenvalue of graphs
Sida Li
Let be a graph on vertices, whose adjacency matrix has eigenvalues . The problem of bounding in terms of was first propos…