Spectral extremal graphs for disjoint cliques

DOI10.37236/11516OpenAlexW4318313681MaRDI QIDQ2684892

Jing Wang, Zhenyu Ni, Li-ying Kang

Publication date: 17 February 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.06550

zbMATH Keywords

spectral radiusTurán graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (3)

Spectral extrema of graphs with bounded clique number and matching number ⋮ Spectral extrema of \(\{ K_{k + 1}, \mathcal{L}_s \}\)-free graphs ⋮ Spectral extremal problem on disjoint color-critical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
• A contribution to the Zarankiewicz problem
• The spectral radius of graphs without paths and cycles of specified length
• Degrees and matchings
• Extremal graphs for intersecting cliques
• Extremal graphs for intersecting triangles
• Spectral extremal graphs for intersecting cliques
• The spectral radius of graphs with no intersecting odd cycles
• A unique characterization of spectral extrema for friendship graphs
• The spectral Turán problem about graphs with no 6-cycle
• The maximum spectral radius of graphs without friendship subgraphs
• The spectral radius of graphs with no odd wheels
• Generalized Turán problems for disjoint copies of graphs
• Spectral extrema for graphs: the Zarankiewicz problem
• Bounds on graph eigenvalues. II
• A spectral condition for odd cycles in graphs
• Cliques and the spectral radius
• On a conjecture of spectral extremal problems
• Stability for large forbidden subgraphs
• The Algorithmic Aspects of the Regularity Lemma
• On Independent Complete Subgraphs in a Graph

This page was built for publication: Spectral extremal graphs for disjoint cliques