A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Extremal graph for intersecting odd cycles
unpublished
Preserved Fulltext
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˝ os et al. (1995) determined the extremal graphs for intersecting triangles and Chen et al. (2003) determined the maximum number
fatcat:e4cyvuakqjaabdf4ystkolagby