Infinite homogeneous bipartite graphs with unequal sides

Details Infinite homogeneous bipartite graphs with unequal sides Infinite homogeneous bipartite graphs with unequal sides

1994-09-06

arxiv.org/abs/math/9409204v1

Mathematics

Logic

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Infinite homogeneous bipartite graphs with unequal sides 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 Infinite homogeneous bipartite graphs with unequal sides, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Infinite homogeneous bipartite graphs with unequal sides will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-702399