Universal bridge-free graphs

MaRDI QIDQ6502057arXivFDO

Authors Martin Goldstern, Menachem Kojman

Published in arXiv

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 $kge2$.

This page was built for publication: Universal bridge-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6502057)