Scholarlink

<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ïssé limit.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Countable homogeneous ordered bipartite graphs

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年9月8日

查看全文
  • J. K. Truss

摘要

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.