✦ LIBER ✦

On some classes of orderable groups

✍ Scribed by Longobardi, Patrizia ;Maj, Mercede

Publisher: Springer-Verlag
Year: 1998
Weight: 578 KB
Volume: 68
Category: Article
ISSN: 0370-7377
DOI: 10.1007/bf02925836

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Π10 classes and orderable groups

✍ Reed Solomon 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 183 KB

It is known that the spaces of orders on orderable computable ÿelds can represent all 0 1 classes up to Turing degree. We show that the spaces of orders on orderable computable abelian and nilpotent groups cannot represent 0 1 classes in even a weak manner. Next, we consider presentations of ordered

Some classes of perfectly orderable grap

Some classes of perfectly orderable graphs

✍ C. T. Hoàng; B. A. Reed 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 815 KB

In 1981, Chvatal defined the class of perfectly orderable graphs. This class of perfect graphs contains the comparability graphs and the triangulated graphs. In this paper, we introduce four classes of perfectly orderable graphs, including natural generalizations of the comparability and triangulate

Recognition of some perfectly orderable

Recognition of some perfectly orderable graph classes

✍ Elaine M. Eschen; Julie L. Johnson; Jeremy P. Spinrad; R Sritharan 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 190 KB

On Borel orderable groups

✍ J.R.P. Christensen; Vladimir Kanovei; Michael Reeken 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 163 KB

We prove that any Borel Abelian ordered group B, having a countable subgroup G as the largest convex subgroup, and such that the quotient B/G is order isomorphic to R, the reals, is Borel grouporder isomorphic to the product R × G, ordered lexicographically. As a main ingredient of this proof, we sh

On the classes of orderable semigroups i

On the classes of orderable semigroups in varieties

✍ U. K. Kuspanov 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 758 KB

Four classes of perfectly orderable grap

Four classes of perfectly orderable graphs

✍ V. Chvátal; C. T. Hoàng; N. V. R. Mahadev; D. De Werra 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 638 KB

A graph is called "perfectly orderable" if its vertices can be ordered in such a way that, for each induced subgraph F, a certain "greedy" coloring heuristic delivers an optimal coloring of F. No polynomial-time algorithm to recognize these graphs is known. We present four classes of perfectly order