Premium
Subdivisions of large complete bipartite graphs and long induced paths in k ‐connected graphs
Author(s) -
Böhme Thomas,
Mohar Bojan,
Škrekovski Riste,
Stiebitz Michael
Publication year - 2004
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/jgt.10161
Subject(s) - combinatorics , mathematics , bipartite graph , subdivision , complete bipartite graph , discrete mathematics , graph , cograph , pancyclic graph , 1 planar graph , chordal graph , archaeology , history
It is proved that for every positive integers k , r and s there exists an integer n = n ( k , r , s ) such that every k ‐connected graph of order at least n contains either an induced path of length s or a subdivision of the complete bipartite graph K k,r . © 2004 Wiley Periodicals, Inc. J Graph Theory 45: 270–274, 2004
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom