Universal bridge-free graphs
| dc.creator | Goldstern, Martin | |
| dc.creator | Kojman, Menachem | |
| dc.date | 1994-09-06 | |
| dc.date.accessioned | 2026-07-07T09:15:10Z | |
| dc.date.available | 2026-07-07T09:15:10Z | |
| dc.description | We prove that there is no countable universal $B_n$-free graph for all $n$ and that there is no countable universal graph in the class of graphs omitting all cycles of length at most $2k$ for $k\ge 2$. | |
| dc.identifier | https://arxiv.org/abs/math/9409206 | |
| dc.identifier | http://arxiv.org/abs/math/9409206 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/152929 | |
| dc.subject | Logic | |
| dc.title | Universal bridge-free graphs | |
| dc.type | text |