Homogeneous 2-partite digraphs
Combinatorics
2013-11-21 v1 Logic
Abstract
We call a 2-partite digraph D homogeneous if every isomorphism between finite induced subdigraphs that respects the 2-partition of D extends to an automorphism of D that does the same. In this note, we classify the homogeneous 2-partite digraphs.
Cite
@article{arxiv.1311.5056,
title = {Homogeneous 2-partite digraphs},
author = {Matthias Hamann},
journal= {arXiv preprint arXiv:1311.5056},
year = {2013}
}
Comments
5 pages