Localization of the Caro-Wei bound and its applications to bipartiteness
Aida Abiad, Hitesh Kumar, Shivaramakrishna Pragada
Abstract
We confirm a conjecture of Brause, Randerath, Rautenbach and Schiermeyer (2016) by proving a localized lower bound on the independence number of a graph that strengthens the classical bounds of Fajtlowicz (1978) and of Caro (1979) and Wei (1981), which in turn settles a conjecture by Bertram and Horák (1996). Our proof is based on a new Motzkin--Straus-type inequality involving local clique numbers and the independence number. We then apply the developed methods to study spectral and algebraic measures of graph bipartiteness. In particular, we extend a theorem of Brandt (1998) on spectral bipartiteness from regular Kr+1-free graphs to all Kr+1-free graphs, we improve a general upper bound for the least signless Laplacian eigenvalue of Kr+1-free graphs, and we disprove a conjecture of de Lima, Nikiforov and Oliveira (2016) in the case of K4-free graphs.
Create a lesson
Related papers
On Unavoidable Faces of High-Dimensional Polytopes
Jesús A. De Loera, Ethan X. Fang, Shengtao Guo et al.
Graphs with Long Pseudosimilarity Chains under Consecutive Vertex Deletions
Sergey Ivanov
List coloring C3-free planar graphs with a sparse matching of restricted lists
Stephen G. Hartke, Yupei Li, Joseph Pappe et al.
On the gonality of Kneser graphs
Luis A. Ballinas, Willoughby Caine, D. Blake Hopkins et al.
Varieties of chain complexes and mixed dimer covers
Portia X. Anderson, Esther Banaian, Melanie J. Ferreri et al.
On the Generating Graph of Finite Abelian Groups
Kavita Samant, A. Satyanarayana Reddy