On the order of countable graphs
| dc.creator | Nešetřil, Jaroslav | |
| dc.creator | Shelah, Saharon | |
| dc.date | 2004-04-18 | |
| dc.date.accessioned | 2026-07-07T05:07:31Z | |
| dc.date.available | 2026-07-07T05:07:31Z | |
| dc.description | A set of graphs is said to be independent if there is no homomorphism between distinct graphs from the set. We consider the existence problems related to the independent sets of countable graphs. While the maximal size of an independent set of countable graphs is 2^omega the On Line problem of extending an independent set to a larger independent set is much harder. We prove here that singletons can be extended (``partnership theorem''). While this is the best possible in general, we give structural conditions which guarantee independent extensions of larger independent sets. This is related to universal graphs, rigid graphs and to the density problem for countable graphs. | |
| dc.identifier | https://arxiv.org/abs/math/0404319 | |
| dc.identifier | http://arxiv.org/abs/math/0404319 | |
| dc.identifier | European Journal of Combinatorics, 24(2003):649-663 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/70889 | |
| dc.subject | Logic | |
| dc.subject | Combinatorics | |
| dc.title | On the order of countable graphs | |
| dc.type | text |