Mathematics – Logic
Scientific paper
1994-09-06
Mathematics
Logic
Scientific paper
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$.
Goldstern Martin
Kojman Menachem
No associations
LandOfFree
Universal bridge-free graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Universal bridge-free graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal bridge-free graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-702403