✦ LIBER ✦

On the existence of a reasonable upper bound for the van der Waerden numbers

✍ Scribed by Raymond N Greenwell; Bruce M Landman

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 239 KB
Volume: 50
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(89)90006-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Pseudo Upper Bound for the van der Wae

A Pseudo Upper Bound for the van der Waerden Function

✍ Tom C. Brown 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 89 KB

For each positive integer n, let the set of all 2-colorings of the interval [1, n]= [1, 2, ..., n] be given the uniform probability distribution, that is, each of the 2 n colorings is assigned probability 2 &n . Let f be any function such that f (k)Âlog k Ä as k Ä . For convenience we assume that f

On an upper bound for the harmonious chr

On an upper bound for the harmonious chromatic number of a graph

✍ Zhikang Lu 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 2 views

## Abstract The upper bound for the harmonious chromatic number of a graph that has been given by Sin‐Min Lee and John Mitchem is improved.

An upper bound on the path number of a d

An upper bound on the path number of a digraph

✍ Richard C O'Brien 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 431 KB

New upper bounds for the chromatic numbe

New upper bounds for the chromatic number of a graph

✍ Ladislav Stacho 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 55 KB 👁 3 views

An upper bound for the path number of a

An upper bound for the path number of a graph

✍ Alan Donald 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 529 KB

## Abstract The path number of a graph __G__, denoted __p(G)__, is the minimum number of edge‐disjoint paths covering the edges of __G.__ Lovász has proved that if __G__ has __u__ odd vertices and __g__ even vertices, then __p(G)__ ≤ 1/2 __u__ + __g__ ‐ 1 ≤ __n__ ‐ 1, where __n__ is the total numbe

A New Upper Bound on the Cheeger Number

A New Upper Bound on the Cheeger Number of a Graph

✍ Sorin Dragomir; Elisabetta Barletta 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Using a technique developed by A. Nilli (1991, Discrete Math. 91, 207 210), we estimate from above the Cheeger number of a finite connected graph G of small degree (2(G) 5) admitting sufficiently distant edges. ## 2001 Academic Press Let G=(V(G), E(G)) be a finite connected graph. The Cheeger numb