The spectral radius of graphs with no odd wheels
From MaRDI portal
Publication:2237854
DOI10.1016/j.ejc.2021.103420zbMath1480.05085arXiv2104.07729OpenAlexW3197338586MaRDI QIDQ2237854
Sebastian M. Cioabă, Michael Tait, Dheer Noal Sunil Desai
Publication date: 28 October 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.07729
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)
Related Items
Spectral extremal graphs for intersecting cliques ⋮ Signless Laplacian spectral radius of graphs without short cycles or long cycles ⋮ Spectral radius, edge-disjoint cycles and cycles of the same length ⋮ The spectral radius of graphs with no intersecting odd cycles ⋮ A spectral condition for the existence of the square of a path ⋮ A unique characterization of spectral extrema for friendship graphs ⋮ Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait ⋮ Spectral extrema of graphs with bounded clique number and matching number ⋮ A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs ⋮ A Spectral Erdős-Sós Theorem ⋮ Refinement on Spectral Turán’s Theorem ⋮ On a conjecture of spectral extremal problems ⋮ The maximum spectral radius of graphs without spanning linear forests ⋮ Maxima of the \(Q\)-index of non-bipartite graphs: forbidden short odd cycles ⋮ Spectral radius of graphs of given size with forbidden subgraphs ⋮ The unique spectral extremal graph for intersecting cliques or intersecting odd cycles ⋮ Spectral extremal graphs for disjoint cliques ⋮ Spectral radius conditions for the existence of all subtrees of diameter at most four ⋮ Maxima of the \(Q\)-index of non-bipartite \(C_3\)-free graphs ⋮ Spectral extrema of \(\{ K_{k + 1}, \mathcal{L}_s \}\)-free graphs ⋮ Spectral Turán problems for intersecting even cycles ⋮ Spectral extremal problem on disjoint color-critical graphs ⋮ Stability of Woodall's theorem and spectral conditions for large cycles ⋮ The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
- A new proof of the graph removal lemma
- A contribution to the Zarankiewicz problem
- Upper bounds on the spectral radius of book-free and/or \(K_{2,l}\)-free graphs
- The spectral radius of graphs without paths and cycles of specified length
- Spectral saturation: inverting the spectral Turán theorem
- Spectral bounds for the clique and independence numbers of graphs
- The spectral radius of graphs on surfaces
- Turán numbers for odd wheels
- Eigenvalues of subgraphs of the cube
- A bound on the spectral radius of graphs with \(e\) edges
- On the spectral radius of graphs with cut vertices
- Extremal graphs for intersecting triangles
- What we know and what we do not know about Turán numbers
- The Colin de Verdière parameter, excluded minors, and the spectral radius
- A new upper bound on extremal number of even cycles
- The spectral Turán problem about graphs with no 6-cycle
- The maximum spectral radius of graphs without friendship subgraphs
- A new upper bound for the spectral radius of graphs with girth at least 5
- Spectral extrema for graphs: the Zarankiewicz problem
- A spectral condition for odd cycles in graphs
- On the spectral radius of graphs with a given domination number
- The maximum spectral radius of wheel-free graphs
- On Arithmetic Progressions of Cycle Lengths in Graphs
- Some Inequalities for the Largest Eigenvalue of a Graph
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- An Upper Bound on Zarankiewicz' Problem
- Erratum For ‘A Bound on the Number of Edges in Graphs Without an Even Cycle’
- The History of Degenerate (Bipartite) Extremal Graph Problems
- Spectral radius and Hamiltonicity of graphs