Infinite homogeneous bipartite graphs with unequal sides
Abstract
We call a bipartite graph homogeneous if every finite partial automorphism which respects left and right can be extended to a total automorphism. A (,λ ) bipartite graph is a bipartite graph with left side of size and right side of size λ. We show, using a theorem of Hrushovski on finite graphs, that there is a homogeneous (0,20 ) bipartite graph of girth 4 (thus answering negatively a question by Kupitz and Perles), and that depending on the underlying set theory all homogeneous (0,1) bipartite graphs may be isomorphic, or there may be 21 many isomorphism types of (0,1) homogeneous graphs.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.