Spectral Turán problems for intersecting even cycles
From MaRDI portal
Abstract: Let denote the graph obtained by intersecting distinct even cycles at a unique vertex. In this paper, we determine the unique graphs with maximum adjacency spectral radius among all graphs on vertices that do not contain any as a subgraph, for sufficiently large. When one of the constituent even cycles is a , our results improve upper bounds on the Tur'an numbers for intersecting even cycles that follow from more general results of F"{u}redi [20] and Alon, Krivelevich and Sudakov [1]. Our results may be seen as extensions of previous results for spectral Tur'an problems on forbidden even cycles (see [8, 34, 44, 45]).
Recommendations
Cites work
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- scientific article; zbMATH DE number 3372065 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- A bound on the spectral radius of graphs with \(e\) edges
- A contribution to the Zarankiewicz problem
- A new upper bound for the spectral radius of graphs with girth at least 5
- A spectral condition for odd cycles in graphs
- An Upper Bound on Zarankiewicz' Problem
- Bounds on graph eigenvalues. II
- Degree powers in graphs with a forbidden even cycle
- Eigenvalues of subgraphs of the cube
- Extremal graph for intersecting odd cycles
- Extremal graphs for intersecting triangles
- Extremal graphs for the k-flower
- More on the extremal number of subdivisions
- New asymptotics for bipartite Turán numbers
- Norm-graphs: Variations and applications
- On a Turán type problem of Erdős
- On a class of degenerate extremal graph problems
- On a problem of K. Zarankiewicz
- On maximal paths and circuits of graphs
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- On the extremal number of subdivisions
- On the spectral radii of graphs without given cycles
- On the spectral radius of graphs with a given domination number
- On the spectral radius of graphs with cut vertices
- On the structure of linear graphs
- Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
- Spectral bounds for the clique and independence numbers of graphs
- Spectral extrema for graphs: the Zarankiewicz problem
- Spectral extrema of graphs: forbidden hexagon
- Spectral extremal graphs for intersecting cliques
- Spectral radius and Hamiltonicity of graphs
- The history of degenerate (bipartite) extremal graph problems
- The maximum spectral radius of graphs without friendship subgraphs
- The spectral Turán problem about graphs with no 6-cycle
- The spectral radius of graphs on surfaces
- The spectral radius of graphs with no intersecting odd cycles
- The spectral radius of graphs with no odd wheels
- The spectral radius of graphs without paths and cycles of specified length
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- Turán number and decomposition number of intersecting odd cycles
- Turán number of bipartite graphs with no \(K_{t,t}\)
- Upper bounds on the spectral radius of book-free and/or \(K_{2,l}\)-free graphs
Cited in
(5)- The signless Laplacian spectral radius of 2K₃-free graphs
- On the spectral Turán problem of theta graphs
- Spectral extremal graphs without intersecting triangles as a minor
- Spectral extremal problem for intersecting one even and one odd cycle
- Ordering graphs with fixed size and girth by their \(A_{\alpha}\)-spectral radius
This page was built for publication: Spectral Turán problems for intersecting even cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6187353)