On the smallest eigenvalues of 3-colorable graphs

Abstract

We prove that the set of the smallest eigenvalues attained by 3-colorable graphs is dense in (-∞, -λ*), where λ* = 1/2 + -1/2 ≈ 2.01980 and is the positive real root of x3 = x + 1. As a consequence, in the context of spherical two-distance sets, our result precludes any further refinement of the forbidden-subgraph method through the chromatic number of signed graphs.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…