Date of Original Version

1992

Type

Technical Report

Abstract or Table of Contents

Abstract: "We call a bipartite graph homogeneous if every finite partial automorphism which respects left and right can be extended to a total automorphism. We classify all countable homogeneous bipartite graphs. A ([kappa], [lambda]) bipartite graph is a bipartite graph with left side of size [kappa] and right side of size [lambda]. We show that there is always a homogeneous (N₀,2[superscript n0]) bipartite graph (thus answering negatively a question by Kupitz and Perles), and that depending on the underlying set theory all homogeneous (N₀, N₁) bipartite graphs may be isomorphic, or there may be 2[superscript N¹] many isomorphism types of (N₀, N₁) homogeneous graphs."

Share

COinS