Homogeneous 2-partite digraphs

Homogeneous 2-partite digraphs

We call a 2-partite digraph Dhomogeneous 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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete mathematics 2014-07, Vol.327, p.36-39
1. Verfasser: Hamann, Matthias
Format: Artikel
Sprache:eng
Schlagworte:
Automorphisms
Bipartite digraphs
Classification
Graph theory
Homogeneity
Isomorphism
Mathematical analysis
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We call a 2-partite digraph Dhomogeneous 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.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2014.03.012