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 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 bipartite graph of girth 4 (thus answering negatively a question by Kupitz and Perles), and that depending on the underlying set theory all homogeneous bipartite graphs may be isomorphic, or there may be many isomorphism types of 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}
}