𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph colorings and recursively bounded Π10-classes

✍ Scribed by J.B. Remmel

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
730 KB
Volume
32
Category
Article
ISSN
0168-0072

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Π10 classes and orderable groups
Π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

Perfect coloring and linearly χ-bound P6
Perfect coloring and linearly χ-bound P6-free graphs
✍ S. A. Choudum; T. Karthick; M. A. Shalu 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB

## Abstract We derive decomposition theorems for __P__~6~, __K__~1~ + __P__~4~‐free graphs, __P__~5~, __K__~1~ + __P__~4~‐free graphs and __P__~5~, __K__~1~ + __C__~4~‐free graphs, and deduce linear χ‐binding functions for these classes of graphs (here, __P__~__n__~ (__C__~__n__~) denotes the path

A class of self-complementary graphs and
A class of self-complementary graphs and lower bounds of some ramsey numbers
✍ C. R. J. Clapham 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB 👁 1 views

## Abstract A method is described of constructing a class of self‐complementary graphs, that includes a self‐complementary graph, containing no __K__~5~, with 41 vertices and a self‐complementary graph, containing no __K__~7~, with 113 vertices. The latter construction gives the improved Ramsey num