The spectral radius of graphs with no intersecting odd cycles
From MaRDI portal
Publication:2142645
DOI10.1016/j.disc.2022.112907zbMath1505.05074arXiv2106.00587OpenAlexW4220873752MaRDI QIDQ2142645
Publication date: 27 May 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.00587
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Distance in graphs (05C12)
Related Items (13)
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 extremal graphs for the bowtie ⋮ 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 ⋮ The unique spectral extremal graph for intersecting cliques or intersecting odd cycles ⋮ Spectral extremal graphs for disjoint cliques ⋮ Maxima of the \(Q\)-index of non-bipartite \(C_3\)-free graphs ⋮ Spectral Turán problems for intersecting even cycles ⋮ Maxima of the \(Q\)-index: forbidden a Fan
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal graph for intersecting odd cycles
- 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
- The spectral radius of graphs without paths and cycles of specified length
- Spectral bounds for the clique and independence numbers of graphs
- On a Turán type problem of Erdős
- Degrees and matchings
- Extremal graphs for intersecting triangles
- New asymptotics for bipartite Turán numbers
- On the number of edges of quadrilateral-free graphs
- The signless Laplacian spectral radius of graphs with no intersecting triangles
- The maximum spectral radius of graphs without friendship subgraphs
- More on the extremal number of subdivisions
- The spectral radius of graphs with no odd wheels
- Spectral extrema for graphs: the Zarankiewicz problem
- Turán number and decomposition number of intersecting odd cycles
- Inverses of triangular matrices and bipartite graphs
- Bounds on graph eigenvalues. II
- Intersection theorems for systems of sets
- Graph removal lemmas
- Some new results in extremal graph theory
- Some Inequalities for the Largest Eigenvalue of a Graph
- On maximal paths and circuits of graphs
- A Spectral Erdős–Stone–Bollobás Theorem
- Extremal graphs for the k‐flower
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- An Upper Bound on Zarankiewicz' Problem
- On the Extremal Number of Subdivisions
- The History of Degenerate (Bipartite) Extremal Graph Problems
- On a problem of K. Zarankiewicz
- On the structure of linear graphs
- Spectral radius and Hamiltonicity of graphs
- Matrix theory. Basic results and techniques
This page was built for publication: The spectral radius of graphs with no intersecting odd cycles
