Spectral extremal problems for non-bipartite graphs without odd cycles
From MaRDI portal
Cites work
- A complete solution to the Cvetković–Rowlinson conjecture
- A conjecture on the spectral radius of graphs
- A note on cycle lengths in graphs
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
- A spectral condition for odd cycles in graphs
- A spectral condition for odd cycles in non-bipartite graphs
- A spectral condition for the existence of a pentagon in non-bipartite graphs
- A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs
- A spectral Erdős-Faudree-Rousseau theorem
- A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
- A unique characterization of spectral extrema for friendship graphs
- Adjacency eigenvalues of graphs without short odd cycles
- Bounds on graph eigenvalues. II
- Dense graphs with small clique number
- Dense neighbourhoods and Turan's theorem
- Edge maximal non-bipartite graphs without odd cycles of prescribed lengths
- Eigenvalues and cycles of consecutive lengths
- Eigenvalues and triangles in graphs
- Extensions of the Erdős-Gallai theorem and Luo's theorem
- Forbidden theta graph, bounded spectral radius and size of non-bipartite graphs
- Graph theory
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3691361 (Why is no real title available?)
- scientific article; zbMATH DE number 3512165 (Why is no real title available?)
- scientific article; zbMATH DE number 3570494 (Why is no real title available?)
- scientific article; zbMATH DE number 3372065 (Why is no real title available?)
- Large cycles in graphs
- Large dense neighbourhoods and Turán's theorem
- Maximum \(K_{r+1}\)-free graphs which are not \(r\)-partite.
- Minimum degree stability of \({C}_{2k+1}\)-free graphs
- Note on the structure of graphs with bounded clique number
- ODD Cycles of Specified Length in Non-Bipartite Graphs
- On maximal paths and circuits of graphs
- On the chromatic number of pentagon-free graphs of large minimum degree
- On the chromatic number of triangle-free graphs of large minimum degree
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- On the maximal index of graphs with a prescribed number of edges
- On the non-(p-1)-partite K_p-free graphs
- On the structure of triangle-free graphs of large minimum degree
- Pancyclic graphs. I
- Refinement on Spectral Turán’s Theorem
- Small graphs with chromatic number 5: A computer search
- Some Inequalities for the Largest Eigenvalue of a Graph
- Spectra of graphs. Theory and application
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- Spectral extremal graphs for the bowtie
- Spectral radius, edge-disjoint cycles and cycles of the same length
- Spectral supersaturation: triangles and bowties
- Sufficient Conditions for Circuits in Graphs†
- The maximum spectral radius of graphs without friendship subgraphs
- The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
- The spectral radius of trees on \(k\) pendant vertices
- The spectral radius, maximum average degree and cycles of consecutive lengths of graphs
- Tight bound on the minimum degree to guarantee graphs forbidding some odd cycles to be bipartite
- Triangle-free four-chromatic graphs
- Walks and the spectral radius of graphs
- Weakly pancyclic graphs
This page was built for publication: Spectral extremal problems for non-bipartite graphs without odd cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6930293)
