✦ LIBER ✦

A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph

✍ Scribed by Jaroslav Nešetřil; Vojtěch Rōdl

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 845 KB
Volume: 23
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(78)90186-3

No coin nor oath required. For personal study only.

✦ Synopsis

Using a representation of finite graphs by direct products we prove the theorem given in the title in a very simple way. Moreover, we introduce a dimension of a graph analogous to the Dushnik-Miller dimension of a partially ordered se:.

📜 SIMILAR VOLUMES

A simple proof of the characterization o

A simple proof of the characterization of antipodal graphs

✍ Garry Johns 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 88 KB

The antipodal graph A(G) of a graph G is defined as the graph on the same vertex set as G with two vertices being adjacent in A(G) if the distance between them in G is the diameter of G. (If G is disconnected then we define &am(G) = co.) Aravamudhan and Rajendran [l, 21 gave the following character

Generalized Ramsey theory for graphs IV,

Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph

✍ F. Harary; G. Prins 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 412 KB

A paopm graph G has no isolated points. I t s R m e y r u m b a r ( G ) i s the m i n i m p such that every 2-coloring of the edges of K contains a monochromatic G. The Ramhey m & t @ m y R(G) i s P the r (G) ' With j u s t one exception, namely Kq, we determine R(G) f o r proper graphs u i t h a t

The rotational dimension of a graph

✍ Frank Göring; Christoph Helmberg; Markus Wappler 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

The circular dimension of a graph

✍ Robert B. Feinberg 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 484 KB

A graph is a pair (V, I), V being the vertices and I being the relation of adjacency on V. Given a grqh G, then a collection of functions (fi}~ ,, each fi mapping each vertex of V into an arc on a fixed circle, is said to define an m-arc intersection model for G if for all x, y E V, xly e=, (Vi~ml(f

On a property of the class of n-colorabl

On a property of the class of n-colorable graphs

✍ D Seinsche 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 129 KB

Bounds for the ramsey number of a discon

Bounds for the ramsey number of a disconnected graph versus any graph

✍ Ronald J. Gould; Michael S. Jacobson 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB 👁 1 views

## Abstract Bounds are determined for the Ramsey number of the union of graphs versus a fixed graph __H__, based on the Ramsey number of the components versus __H__. For certain unions of graphs, the exact Ramsey number is determined. From these formulas, some new Ramsey numbers are indicated. In p