Sciweavers

GC
2002
Springer

Ramsey-Type Results for Unions of Comparability Graphs

13 years 3 months ago
Ramsey-Type Results for Unions of Comparability Graphs
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand, there exist such graphs for which the largest clique and independent set are of size at most n0.4118 . Similar results are obtained for graphs which are a union of a fixed number k of comparability graphs. We also show that the same bounds hold for unions of perfect graphs. A geometric application is included.
Adrian Dumitrescu, Géza Tóth
Added 19 Dec 2010
Updated 19 Dec 2010
Type Journal
Year 2002
Where GC
Authors Adrian Dumitrescu, Géza Tóth
Comments (0)