Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Journals
  3. Canadian Journal of Mathematics
  4. Volume 29 Issue 3
Journal Home
Refine listing

Refine listing

Access:
Publication date:

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×
< Back to all issues

Volume 29 - Issue 3 - 01 June 1977

Contents

Page 2 of 2

Research Article

  • Compatible Tight Riesz Orders on the Group of Automorphisms of an 0-2-Homogeneous Set: Addendum

  • Gary Davis, Colin D. Fox
  • Published online by Cambridge University Press:
    20 November 2018, pp. 664-665
    • Article
      • You have access
    • PDF
    • Export citation

  • The purpose of this note is to show that Theorem 8 of Davis and Fox [1] is sharp. That is, we show that the following result is valid.

    THEOREM. Let Ω be an 0-2-homogeneous ordered set. Then Tρ(respectively, Tƛ ) is a maximal compatible tight Riesz order if and only if Ω has a countable cofinal(respectively, coinitial) subset.

  • Split Graphs Having Dilworth Number Two

  • Stephane Foldes, Peter L. Hammer
  • Published online by Cambridge University Press:
    20 November 2018, pp. 666-672
    • Article
      • You have access
    • PDF
    • Export citation

  • All graphs considered in this paper are finite, undirected, loopless and without multiple edges.

    The vertex set and the edge set of a graph G will be denoted by V(G) and E(G)y respectively. Thus we have

Page 2 of 2