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}$. Erdős et al. (1995) determined the extremal graphs for intersecting triangles and Chen et al. (2003) 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.
@article{10_37236_5851,
author = {Xinmin Hou and Yu Qiu and Boyuan Liu},
title = {Extremal graph for intersecting odd cycles},
journal = {The electronic journal of combinatorics},
year = {2016},
volume = {23},
number = {2},
doi = {10.37236/5851},
zbl = {1337.05062},
url = {http://geodesic.mathdoc.fr/articles/10.37236/5851/}
}
TY - JOUR
AU - Xinmin Hou
AU - Yu Qiu
AU - Boyuan Liu
TI - Extremal graph for intersecting odd cycles
JO - The electronic journal of combinatorics
PY - 2016
VL - 23
IS - 2
UR - http://geodesic.mathdoc.fr/articles/10.37236/5851/
DO - 10.37236/5851
ID - 10_37236_5851
ER -
%0 Journal Article
%A Xinmin Hou
%A Yu Qiu
%A Boyuan Liu
%T Extremal graph for intersecting odd cycles
%J The electronic journal of combinatorics
%D 2016
%V 23
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/5851/
%R 10.37236/5851
%F 10_37236_5851
Xinmin Hou; Yu Qiu; Boyuan Liu. Extremal graph for intersecting odd cycles. The electronic journal of combinatorics, Tome 23 (2016) no. 2. doi: 10.37236/5851
