{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:38:47Z","timestamp":1760488727998,"version":"build-2065373602"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"7-8","license":[{"start":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T00:00:00Z","timestamp":1757289600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T00:00:00Z","timestamp":1757289600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>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\u00efss\u00e9 limit.<\/jats:p>","DOI":"10.1007\/s00153-025-00986-1","type":"journal-article","created":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T09:53:06Z","timestamp":1757411586000},"page":"1165-1180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Countable homogeneous ordered bipartite graphs"],"prefix":"10.1007","volume":"64","author":[{"given":"J. K.","family":"Truss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,8]]},"reference":[{"key":"986_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcta.2003.08.005","volume":"105","author":"G Campero-Arena","year":"2004","unstructured":"Campero-Arena, G., Truss, J.K.: Countable 1-transitive, coloured linear orderings I. J. Combin. Theory 105, 1\u201313 (2004)","journal-title":"J. Combin. Theory"},{"doi-asserted-by":"crossref","unstructured":"Cherlin, G.L.: The classification of countable homogeneous directed graphs and countable homogeneous tournaments, Mem. Amer. Math. Soc. 131 (621) (1998)","key":"986_CR2","DOI":"10.1090\/memo\/0621"},{"key":"986_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0012-365X(94)00339-K","volume":"149","author":"M Goldstern","year":"1996","unstructured":"Goldstern, M., Grossberg, R., Kojman, M.: Infinite homogeneous bipartite graphs with unequal sides. Discret. Math. 149, 69\u201382 (1996)","journal-title":"Discret. Math."},{"key":"986_CR4","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1017\/jsl.2020.10","volume":"85","author":"W Kubi\\'s","year":"2020","unstructured":"Kubis, W., Shelah, S.: Homogeneous structures without universal automorphism groups. J. Symb. Log. 85, 817\u2013827 (2020)","journal-title":"J. Symb. Log."},{"key":"986_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1090\/S0002-9947-1980-0583847-2","volume":"262","author":"AH Lachlan","year":"1980","unstructured":"Lachlan, A.H., Woodrow, R.E.: Countable ultrahomogeneous undirected graphs. Trans. Amer. Math. Soc. 262, 51\u201394 (1980)","journal-title":"Trans. Amer. Math. Soc."},{"unstructured":"$${\\rm Ne}\\breve{{\\rm s}}{\\rm et}\\breve{{\\rm r}}{\\rm il}$$, J., R\u00f6dl, V.: Ramsey classes of set systems. J. Combin. Theory Ser A 34, 183\u2013201 (1983)","key":"986_CR6"},{"key":"986_CR7","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ejc.2011.04.004","volume":"33","author":"Tristan Jenkinson","year":"2012","unstructured":"Tristan Jenkinson, J.K.: Truss, and Daniel Seidel, Countable homogeneous multipartite graphs. Eur. J. Comb. 33, 82\u2013109 (2012)","journal-title":"Eur. J. Comb."}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-025-00986-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00153-025-00986-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-025-00986-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T17:01:52Z","timestamp":1760461312000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00153-025-00986-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,8]]},"references-count":7,"journal-issue":{"issue":"7-8","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["986"],"URL":"https:\/\/doi.org\/10.1007\/s00153-025-00986-1","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"type":"print","value":"0933-5846"},{"type":"electronic","value":"1432-0665"}],"subject":[],"published":{"date-parts":[[2025,9,8]]},"assertion":[{"value":"26 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}