STRONGLY PERFECT INFINITE-GRAPHS

Authors
Citation
R. Aharoni et M. Loebl, STRONGLY PERFECT INFINITE-GRAPHS, Israel Journal of Mathematics, 90(1-3), 1995, pp. 81-91
Citations number
5
Categorie Soggetti
Mathematics, General",Mathematics
ISSN journal
00212172
Volume
90
Issue
1-3
Year of publication
1995
Pages
81 - 91
Database
ISI
SICI code
0021-2172(1995)90:1-3<81:SPI>2.0.ZU;2-X
Abstract
An infinite graph G is called strongly perfect ii each induced subgrap h of G has a coloring (C-i: i is an element of I) and a clique meeting each color C-i. A conjecture of the first author and V. Korman is tha t a perfect graph with no infinite independent set is strongly perfect . We prove the conjecture for chordal graphs and for their complements .