Date of Original Version

1994

Type

Technical Report

Rights Management

All Rights Reserved

Abstract or Description

Abstract: "We prove that there is no countable universal B[subscript 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 [> or =] 2."

Share

COinS