Extremal graph for intersecting odd cycles (Q286112)

Summary: An extremal graph for a graph \(H\) on \(n\) vertices is a graph on \(n\) vertices with maximum number of edges that does not contain \(H\) as a subgraph. Let \(T_{n,r}\) be the Turán graph, which is the complete \(r\)-partite graph on \(n\) vertices with part sizes that differ by at most one. The well-known Turán Theorem states that \(T_{n,r}\) is the only extremal graph for complete graph \(K_{r+1}\). \textit{P. Erdős} et al. [J. Comb. Theory, Ser. B 64, No. 1, 89--100 (1995; Zbl 0822.05036)] determined the extremal graphs for intersecting triangles and \textit{G. Chen} et al. [ibid. 89, No. 2, 159--171 (2003; Zbl 1031.05069)] determined the maximum number of edges of the extremal graphs for intersecting cliques. In this paper, we determine the extremal graphs for intersecting odd cycles.