An extremal problem for subdivisions ofK?5

✍ Scribed by Mader, W.

• Publisher: John Wiley and Sons
• Year: 1999
• Tongue: English
• Weight: 248 KB
• Volume: 30
• Category: Article
• ISSN: 0364-9024
• DOI: 10.1002/(sici)1097-0118(199904)30:4<261::aid-jgt2>3.0.co;2-z

✦ Synopsis

It is proved that every graph G with G ≥ 2|G| -5, |G| ≥ 6, and girth at least 5, except the Petersen graph, contains a subdivision of K - 5 , the complete graph on five vertices minus one edge.