OpenAlex ·
Localization of the Caro-Wei bound and its applications to bipartiteness
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.00210
- Original
- Read it at the publisher
- Topics
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 $K_{r+1}$-free graphs to all $K_{r+1}$-free graphs, we improve a general upper bound for the least signless Laplacian eigenvalue of $K_{r+1}$-free graphs, and we disprove a conjecture of de Lima, Nikiforov and Oliveira (2016) in the case of $K_4$-free graphs.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.