Homogeneous 2-partite digraphs
From MaRDI portal
Publication:2449161
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.
Recommendations
Cites work
- A survey of homogeneous structures
- Countable homogeneous partially ordered sets
- Countable Homogeneous Tournaments
- Countable Ultrahomogeneous Undirected Graphs
- Homogeneous graphs
- scientific article; zbMATH DE number 3819758 (Why is no real title available?)
- scientific article; zbMATH DE number 4010503 (Why is no real title available?)
- scientific article; zbMATH DE number 3080680 (Why is no real title available?)
- Infinite homogeneous bipartite graphs with unequal sides
- The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
- Theory of relations. Transl. from the French by P. Clote
Cited in
(6)
This page was built for publication: Homogeneous 2-partite digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2449161)