Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Countable homogeneous ordered bipartite graphs

J. K. Truss

Abstract

A classification is given of all the countable homogeneous ordered bipartite graphs.

Countable homogeneous ordered bipartite graphs

Abstract

A classification is given of all the countable homogeneous ordered bipartite graphs.
Paper Structure (3 sections, 2 theorems, 1 equation)

This paper contains 3 sections, 2 theorems, 1 equation.

Table of Contents

  1. Introduction
  2. Subdivision into cases
  3. The main result

Key Result

Lemma 2.1

Let $(X, <, R)$ be a countable homogeneous ordered bipartite graph in which $(X, <)$ is a linear order, and $(X,R)$ is a bipartite graph with parts distinguished by 'red' and 'blue'. Then as a 2-coloured linear ordering, $(X, <)$ is isomorphic to one of the following: (I) Degenerate cases (i) a sing

Theorems & Definitions (2)

  • Lemma 2.1
  • Theorem 3.1