✦ LIBER ✦

The irredundant ramsey number s(3, 7)

✍ Scribed by Guantao Chen; Cecil C. Rousseau

Publisher: John Wiley and Sons
Year: 1995
Tongue: English
Weight: 395 KB
Volume: 19
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190190211

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The irredundant Ramsey number s(m, n) is the smallest p such that for every graph G with p vertices, either G contains an n‐element irredundant set or its complement G contains an m‐element irredundant set. Cockayne, Hattingh, and Mynhardt have given a computer‐assisted proof that s(3, 7) = 18. The purpose of this paper is to give a self‐contained proof of this result. © 1995 John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

The value of the Ramsey number r(3, 8)

✍ Brendan D. McKay; Zhang Ke Min 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 361 KB

## Abstract The Ramsey number __R__(3, 8) can be defined as the least number __n__ such that every graph on __n__ vertices contains either a triangle or an independent set of size 8. With the help of a substantial amount of computation, we prove that __R__(3, 8)=28.

On the Ramsey number of trees versus gra

On the Ramsey number of trees versus graphs with large clique number

✍ Ronald J. Gould; Michael S. Jacobson 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 335 KB

Chvatal established that r(T,, K,,) = (m -1 ) ( n -1 ) + 1, where T, , , is an arbitrary tree of order m and K, is the complete graph of order n. This result was extended by Chartrand, Gould, and Polimeni who showed K, could be replaced by a graph with clique number n and order n + 5 provided n 2 3

A Note on Constructive Lower Bounds for

A Note on Constructive Lower Bounds for the Ramsey Numbers R(3, t)

✍ F.R.K. Chung; R. Cleve; P. Dagum 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 189 KB

A constructive approach for the lower bo

A constructive approach for the lower bounds on the Ramsey numbers R (s, t)

✍ Xu Xiaodong; Xie Zheng; Stanisław P. Radziszowski 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB 👁 1 views

## Abstract Graph __G__ is a (__k__, __p__)‐graph if __G__ does not contain a complete graph on __k__ vertices __K__~__k__~, nor an independent set of order __p__. Given a (__k__, __p__)‐graph __G__ and a (__k__, __q__)‐graph __H__, such that __G__ and __H__ contain an induced subgraph isomorphic t

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

An upper bound on the ramsey number R(K3

An upper bound on the ramsey number R(K3, G) depending only on the size of the graph G

✍ A. F. Sidorenko 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 1 views

## Abstract Harary stated the conjecture that for any graph __G__ with __n__ edges and without isolated vertices __r__(__K__~3~,__G__) ⩽ 2__n__ + 1. Erdös, Faudree, Rousseau, and Schelp proved that __r__(__K__~3~,__G__) ⩽ ⌈8/3__n__⌉. Here we prove that __r__(__K__~3~,__G__) ⩽ ⌊5/2__n__⌋ −1 for __n_