Spectral extremal graphs for intersecting cliques

From MaRDI portal
Publication:2125679




Abstract: The (k,r)-fan is the graph consisting of k copies of the complete graph Kr which intersect in a single vertex, and is denoted by Fk,r. ErdH{o}s, F"uredi, Gould and Gunderson [J. Combin. Theory Ser. B 64 (1995) 89--100] determined the maximum number of edges in an n-vertex graph that does not contain Fk,3 as a subgraph. Furthermore, Chen, Gould, Pfender and Wei [J. Combin. Theory Ser. B 89 (2003) 159--171] proved the analogous result on Fk,r for the general case rge3.In this paper, we show that for sufficiently large n, the graphs of order n that contain no copy of Fk,r and attain the maximum spectral radius are also edge-extremal. That is, such graphs must have mathrmex(n,Fk,r) edges.



Cites work







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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2125679)