Homogeneous 2-partite digraphs

2013/11/20 by Matthias Hamann, Hamann, Matthias
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Logic (math.LO) #math.CO #math.LO

paper · pdf · doi:10.48550/arxiv.1311.5056

5 pages

arxiv created 2013/11/20 · arxiv updated 2013/11/21

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.

Related

• Countable connected-homogeneous digraphs
• Set-homogeneous directed graphs
• Infinite homogeneous bipartite graphs with unequal sides
• The classification of finite and locally finite connected-homogeneous digraphs
• On n-partite digraphical representations of finite groups