Premium
An extremal problem for subdivisions of K − 5
Author(s) -
Mader W.
Publication year - 1999
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199904)30:4<261::aid-jgt2>3.0.co;2-z
Subject(s) - combinatorics , mathematics , subdivision , petersen graph , graph , windmill graph , discrete mathematics , graph power , line graph , geography , archaeology
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. © 1999 John Wiley & Sons, Inc, J. Graph Theory 30: 261–276, 1999