Extremal connectivity for topological cliques in bipartite graphs

Daniela Kuhn; Deryk Osthus

doi:10.1016/j.jctb.2005.06.005

Extremal connectivity for topological cliques in bipartite graphs

Daniela Kuhn, Deryk Osthus

Mathematics

Research output: Contribution to journal › Article

4 Citations (Scopus)

Abstract

Let d(s) be the smallest number such that every graph of average degree > d(s) contains a subdivision of K, So far, the best known asymptotic bounds for d(s) are (I + o(l))9s(2)/64

Original language	English
Pages (from-to)	73-99
Number of pages	27
Journal	Journal of Combinatorial Theory. Series B
Volume	96
DOIs	https://doi.org/10.1016/j.jctb.2005.06.005
Publication status	Published - 1 Jan 2006

Keywords

topological minors
connectivity
subdivisions

Access to Document

10.1016/j.jctb.2005.06.005

Cite this

@article{e8bc7c9cf5064bbd87b216d331b4e5c9,

title = "Extremal connectivity for topological cliques in bipartite graphs",

abstract = "Let d(s) be the smallest number such that every graph of average degree > d(s) contains a subdivision of K, So far, the best known asymptotic bounds for d(s) are (I + o(l))9s(2)/64 ",

keywords = "topological minors, connectivity, subdivisions",

author = "Daniela Kuhn and Deryk Osthus",

year = "2006",

month = jan,

day = "1",

doi = "10.1016/j.jctb.2005.06.005",

language = "English",

volume = "96",

pages = "73--99",

journal = "Journal of Combinatorial Theory. Series B",

publisher = "Elsevier",

}

TY - JOUR

T1 - Extremal connectivity for topological cliques in bipartite graphs

AU - Kuhn, Daniela

AU - Osthus, Deryk

PY - 2006/1/1

Y1 - 2006/1/1

N2 - Let d(s) be the smallest number such that every graph of average degree > d(s) contains a subdivision of K, So far, the best known asymptotic bounds for d(s) are (I + o(l))9s(2)/64

AB - Let d(s) be the smallest number such that every graph of average degree > d(s) contains a subdivision of K, So far, the best known asymptotic bounds for d(s) are (I + o(l))9s(2)/64

KW - topological minors

KW - connectivity

KW - subdivisions

UR - http://www.scopus.com/inward/record.url?scp=29244466081&partnerID=8YFLogxK

U2 - 10.1016/j.jctb.2005.06.005

DO - 10.1016/j.jctb.2005.06.005

M3 - Article

VL - 96

SP - 73

EP - 99

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

ER -

Extremal connectivity for topological cliques in bipartite graphs

Abstract

Keywords

Access to Document

Fingerprint

Cite this