The complexity of a class of infinite graphs |
| |
| Authors: | P Komjáth J Pach |
| |
| Institution: | (1) Department of Computer Science, R. Eötvös University, 1088 Budapest, Hungary;(2) Hungarian Academy of Sciences and Dept. of Comp. Sci. City Coll., C.U.N.Y., New York |
| |
| Abstract: | IfG
k
is the family of countable graphs with nok vertex (or edge) disjoint circuits (1<k< ) then there is a countableG
k
 G
k
such that every member ofG
k
is an (induced) subgraph of some member ofG
k
, but no finiteG
k
suffices. |
| |
| Keywords: | 05 C 75 05 C 10 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
