Coloring of universal graphs |
| |
| Authors: | Peter Komjáth Vojtèch Rödl |
| |
| Institution: | (1) Department of Mathematics, Eötvös University, H-1088 Budapest, Hungary;(2) Department of Mathematics, FJFI  VUT, HUSOVA1, Praha 1, Czechoslovakia;(3) AT&T Bell Laboratories, 07974 Murray Hill, NJ, USA |
| |
| Abstract: | LetG be a graph andr a cardinal number. Extending the theorem of J. Folkman we show that if eitherr or clG are finite then there existsH with clH = clG andH  (G)
r
1
. Answering a question of A. Hajnal we show that countably universal graphU
3 satisfiesU
3 (U3)
r
1
for every finiter. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
