pith. sign in

arxiv: math/9409204 · v1 · submitted 1994-09-06 · 🧮 math.LO

Infinite homogeneous bipartite graphs with unequal sides

classification 🧮 math.LO
keywords alephbipartitehomogeneousgraphgraphsautomorphismfinitekappa
0
0 comments X
read the original abstract

We call a bipartite graph {\it homogeneous} if every finite partial automorphism which respects left and right can be extended to a total automorphism. A $(\kappa,{\lambda} )$ bipartite graph is a bipartite graph with left side of size $\kappa$ and right side of size ${\lambda}$. We show, using a theorem of Hrushovski on finite graphs, that there is a homogeneous $({\aleph_0},2^{\aleph_0} )$ bipartite graph of girth 4 (thus answering negatively a question by Kupitz and Perles), and that depending on the underlying set theory all homogeneous $({\aleph_0},\aleph_1)$ bipartite graphs may be isomorphic, or there may be $2^{\aleph_1}$ many isomorphism types of $(\aleph_0,\aleph_1)$ homogeneous graphs.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.