✦ LIBER ✦

A short proof of the degree bound for interval number

✍ Scribed by Douglas B. West

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 141 KB
Volume: 73
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90276-8

No coin nor oath required. For personal study only.

✦ Synopsis

A short proof is given of the fact that every graph has an interval representation of depth 2 in which each vertex u is represented by at most &f(u) + 11 intervals, except for an arbitrarily specified vertex w that appears left-most in the representation and is represented by at most [&d(w) + 1)1 intervals.

📜 SIMILAR VOLUMES

A proof of the branching number bound fo

A proof of the branching number bound for normal manifolds

✍ Stefan Scholtes 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 771 KB

A tighter bounding interval for the 1-ch

A tighter bounding interval for the 1-chromatic number of a surface

✍ Vladimir P. Korzhik 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 889 KB

Let ~1(S) be the maximum chromatic number for all graphs which can be drawn on a surface S so that each edge is crossed over by no more than one other edge. In the previous paper the author has proved that F(S) -34 ~< ~1(S), where F(S) = [\_½(9 + ~/(81 -32E(S))).J is Ringel's upper bound for xl(S) a

A sharp edge bound on the interval numbe

A sharp edge bound on the interval number of a graph

✍ Balogh, J�zsef; Pluh�r, Andr�s 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 2 views

The interval number of a graph G, denoted by i(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. Here we settle a conjecture of Griggs and West about bounding i(G) in terms of e, that is, the number of edges in G. Name

The Exceptional Set for the Number of Pr

The Exceptional Set for the Number of Primes in Short Intervals

✍ D Bazzanella; A Perelli 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 137 KB

We investigate the exceptional set E $ (X, h) associated with the asymptotic formula for the number of primes in short intervals; see Section 1 for the definition. We first obtain two results about the basic structure of this set, proving the inertia and decrease properties; see Theorem 1. Then we t

An improved edge bound on the interval n

An improved edge bound on the interval number of a graph

✍ Jeremy R. Spinrad; G. Vijayan; Douglas B. West 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 2 views

The upper bound on the interval number of a graph in terms of its number of edges is improved. Also, the interval number of graphs in hereditary classes is bounded in terms of the vertex degrees. A representation of a graph as an intersection graph assigns each vertex a set such that vertices are a

A short proof of the preservation of the

A short proof of the preservation of the ωω-bounding property

✍ Chaz Schlindwein 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 86 KB

## Abstract There are two versions of the Proper Iteration Lemma. The stronger (but less well‐known) version can be used to give simpler proofs of iteration theorems (e.g., [7, Lemma 24] versus [9, Theorem IX.4.7]). In this paper we give another demonstration of the fecundity of the stronger versio