Universal bridge-free graphs
classification
🧮 math.LO
keywords
universalcountablegraphgraphstherebridge-freeclasscycles
read the original abstract
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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.