𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Elementary Theory of Interval Real Numbers

✍ Scribed by Stephen D. Comer

Publisher
John Wiley and Sons
Year
1985
Tongue
English
Weight
398 KB
Volume
31
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Arithmetical Hierarchy of Real Numbe
The Arithmetical Hierarchy of Real Numbers
✍ Xizhong Zheng; Klaus Weihrauch πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 225 KB πŸ‘ 1 views
On the interval number of special graphs
On the interval number of special graphs
✍ JΓ³zsef Balogh; Pascal Ochem; AndrΓ‘s PluhΓ‘r πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 116 KB πŸ‘ 1 views

## Abstract The interval number of a graph __G__ is the least natural number __t__ such that __G__ is the intersection graph of sets, each of which is the union of at most __t__ intervals, denoted by __i__(__G__). Griggs and West showed that $i(G)\le \lceil {1\over 2} (d+1)\rceil $. We describe the

Non-constructive Properties of the Real
Non-constructive Properties of the Real Numbers
✍ Paul Howard; Kyriakos Keremedis; Jean E. Rubin; Adrienne Stanley; Eleftherios Ta πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 159 KB πŸ‘ 1 views
On the Interval Number of a Triangulated
On the Interval Number of a Triangulated Graph
✍ Thomas Andreae πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 414 KB πŸ‘ 2 views

The interval number of a simple undirected graph G, denoted i(G), is the least nonnegative integer r for which we can assign to each vertex in G a collection of at most r intervals on the real line such that two distinct vertices u and w of G are adjacent if and only if some interval for u intersect

On the interval number of a chordal grap
On the interval number of a chordal graph
✍ Edward R. Scheinerman πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 249 KB πŸ‘ 2 views

The interval number of a (simple, undirected) graph G is the least positive integer t such that G is the intersection graph of sets, each of which is the union of t real intervals. A chordal (or triangulated) graph is one with no induced cycles on 4 or more vertices. If G is chordal and has maximum