Countable homogeneous ordered bipartite graphs
Abstract A classification is given of all the countable homogeneous ordered bipartite graphs, including those in which just one of the two parts is ordered. In non-trivial cases where the whole structure is ordered, the two parts are ordered like the rationals, and may interact in three essentially different ways. If just one side is ordered, then the structure is the unique one arising as a Fraïssé limit.
Authors
- J. K. Truss (ORCID: https://orcid.org/0000-0002-0502-5042)
Institutions
- University of Leeds (GB)
Publication Details
- Journal
- Archive for Mathematical Logic
- Published
- 2025-09-08
- DOI
- https://doi.org/10.1007/s00153-025-00986-1
- Primary Topic
- Advanced Topology and Set Theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00