
TL;DR
This paper revisits and refines spectral graph theory results related to triangle and cycle existence, providing new proofs, extending bounds, and improving inequalities without relying on some classical tools.
Contribution
It offers two new proofs of the spectral Mantel's Theorem, improves results on consecutive cycles, and extends Stanley's spectral inequality using Nikiforov's techniques.
Findings
Two new proofs of spectral Mantel's Theorem
Improved bounds on consecutive even cycles
Extended Stanley's spectral inequality
Abstract
The well known Mantel's Theorem states that a graph on vertices and edges contains a triangle if . Nosal proved that every graph on edges contains a triangle if the spectral radius , which is a spectral analog of Mantel's Theorem. Furthermore, by using Motzkin-Straus Inequality, Nikiforov sharped Nosal's result and characterized the extremal graphs when the equality holds. Our first contribution in this note is to give two new proofs of the spectral concise Mantel's Theorem due to Nikiforov (without help of Motzkin-Straus Inequality). Nikiforov also obtained some results concerning the existence of consecutive cycles and spectral radius. Second, we prove a theorem concerning the existence of consecutive even cycles and spectral radius, which slightly improves a result of Nikiforov. At last, we focus on spectral radius inequalities. Hong…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Advanced Graph Theory Research · Limits and Structures in Graph Theory
