𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Unit-distance graphs, graphs on the integer lattice and a Ramsey type result

✍ Scribed by Kiran B. Chilakamarri; Carolyn R. Mahoney

Book ID
105322464
Publisher
Springer
Year
1996
Tongue
English
Weight
952 KB
Volume
51
Category
Article
ISSN
0001-9054

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Ramsey multiplicities of graphsβ€”p
On the Ramsey multiplicities of graphsβ€”problems and recent results
✍ Stefan A. Burr; Vera Rosta πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 610 KB

## Abstract Ramsey's theorem guarantees that if __G__ is a graph, then any 2‐coloring of the edges of a large enough complete graph yields a monochromatic copy of __G__. Interesting problems arise when one asks how many such __G__ must occur. A survey of this and related problems is given, along wi

A result on extendibility in the powers
A result on extendibility in the powers of graphs
✍ Kara Walcher Shavo πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 309 KB

## Abstract Let __G__ be a graph on __p__ vertices. Then for a positive integer __n__, __G__ is said to be __n__‐extendible if (i) __n__ < __p__/2, (ii) __G__ has a set of __n__ independent edges, and (iii) every such set is contained in a perfect matching of __G__. The purpose of this article is t

A remark on the intersection arrays of d
A remark on the intersection arrays of distance regular graphs and the distance regular graphs of diameterd= 3iβˆ’ 1 withbi= 1 andk> 2
✍ E. W. Lambeck πŸ“‚ Article πŸ“… 1991 πŸ› Springer 🌐 English βš– 250 KB

Let [' be a distance regular graph with intersection array {bo, bl, . β€’., bd\_l; ct, ..., ed}. It is shown that in same cases (c i 1, ai-I, br I) = (ct, at, bt) and (c2~ t, a2~ 1, b2i l) = (ci, a~, bi) imply k <\_ 2b i + 1. As a corollary all distance regular graphs of diameter d = 3i -1 with b I =