中文

Infinite homogeneous bipartite graphs with unequal sides

逻辑 2009-09-25 v1

摘要

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 (0,20)({\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 (0,1)({\aleph_0},\aleph_1) bipartite graphs may be isomorphic, or there may be 212^{\aleph_1} many isomorphism types of (0,1)(\aleph_0,\aleph_1) homogeneous graphs.

关键词

引用

@article{arxiv.math/9409204,
  title  = {Infinite homogeneous bipartite graphs with unequal sides},
  author = {Martin Goldstern and R. Grossberg and Menachem Kojman},
  journal= {arXiv preprint arXiv:math/9409204},
  year   = {2009}
}