Induced Subdivisions In Ks,s-Free Graphs of Large Average Degree

Authors:
Daniela Kühn;Deryk Osthus
Affiliations:
Freie Universität Berlin, Institut für Mathematik, Germany;Humboldt-Universität zu Berlin, Institut für Informatik, Germany
Venue:
Combinatorica
Year:
2004

Citing 0
Cited 4

A Separator Theorem for String Graphs and Its Applications

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
A separator theorem for string graphs and its applications

Combinatorics, Probability and Computing
On graphs with no induced subdivision of K4

Journal of Combinatorial Theory Series B
Linear time algorithm for computing a small biclique in graphs without long induced paths

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that for every graph H and for every s there exists d=d(H,s) such that every graph of average degree at least d contains either a Ks,s as a subgraph or an induced subdivision of H.