2026/06/03 by Mengyuan Niu, Liwen Lian, Xiumei Wang
Mathematics · #Graph theory and applications #Commutative Algebra and Its Applications #Advanced Combinatorial Mathematics
paper · doi:10.1016/j.disc.2026.115230
A graph G is called maximum matching covered if each edge of G is contained in a maximum matching of G . In this paper, we establish two tight sufficient conditions: one in terms of size and the other in terms of spectral radius, to guarantee that a graph is maximum matching covered. These conditions are tight in the sense that no weaker versions would ensure the results.