Infinite homogeneous bipartite graphs with unequal sides (Q1910569): Difference between revisions

A bipartite graph is called homogeneous if every finite partial homomorphism which respects the left and right side can be extended to an automorphism. A bipartite graph is a \((\kappa, \lambda)\)-graph if the left side has size \(\kappa\) and the right side has size \(\lambda\). The authors show that there are five \((\aleph_0, \aleph_0)\)-bipartite graphs. A homogeneous \((\kappa, \lambda)\)-bipartite graph is nontrivial, if it is different from the empty and the full \((\kappa, \lambda)\)-graph. It is shown that there is a \((\aleph_0, 2^{\aleph_0})\)-homogeneous nontrivial bipartite graph. Martin's axiom implies that there is just one nontrivial \((\aleph_0, \aleph_1)\)-homogeneous bipartite graph. Furthermore the authors show that \(2^{\aleph_0}< 2^{\aleph_1}\) implies that there are \(2^{\aleph_1}\) nontrivial homogeneous \((\aleph_0, \aleph_1)\)-bipartite graphs.