betaFeedback

WorksMathematics

Non-bipartite spectral extremal graphs forbidding a three-chromatic color-critical graph

Abstract

A graph is color-critical if it contains at least one color-critical edge. For every fixed three-chromatic color-critical graph HH, we determine the maximum spectral radius of an nn-vertex non-bipartite HH-free graph and characterize the unique extremal graph for all sufficiently large nn. The extremal graph belongs to one of three graph families: Jn(s,t)J_n(s,t), ST2(n−1)\mathrm{ST}_2(n-1) or Ln(s,t)L_n(s,t). Explicit conditions on HH determine the family and its exact parameters. This paper generalizes the results for books and theta graphs to all three-chromatic color-critical graphs. Furthermore, an three-chromatic example demonstrates that spectral extremal graphs are not necessarily edge-extremal, disproving a conjecture of Fang and Lin [J. Algebraic Combin., 2026].

Paper details

vlnc:W_xhs8nsmp
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC-BY-NC-ND-4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…