✦ LIBER ✦

Ramsey graphs and block designs

✍ Scribed by T.D Parsons

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 483 KB
Volume: 20
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(76)90074-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On block designs arising from rank 3 gra

On block designs arising from rank 3 graphs

✍ V.D. Tonchev 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 663 KB

The connectivity of the block-intersecti

The connectivity of the block-intersection graphs of designs

✍ Donovan R. Hare; William Mc Cuaig 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 187 KB

Ramsey unsaturated and saturated graphs

✍ P. Balister; J. Lehel; R.H. Schelp 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB

## Abstract A graph is __Ramsey unsaturated__ if there exists a proper supergraph of the same order with the same Ramsey number, and __Ramsey saturated__ otherwise. We present some conjectures and results concerning both Ramsey saturated and unsaturated graphs. In particular, we show that cycles __

Zero-sum block designs and graph labelin

Zero-sum block designs and graph labelings

✍ Zsolt Tuza 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 621 KB

Proving a conjecture of Aigner and Triesch, we show that every graph G = (V,E) without isolated vertices and isolated edges admits an edge labeling 5: E -{0,1}" with binary vectors of length m = [log2 nl + 1 such that the sums 6 ( v ) := 1 ; ; ; &(e) (taken modulo 2 componentwise) are mutually disti

Existential closure of block intersectio

Existential closure of block intersection graphs of infinite designs having infinite block size

✍ Daniel Horsley; David A. Pike; Asiyeh Sanaei 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

A graph G is n-existentially closed (n-e.c.) if for each pair (A,B) of disjoint subsets of V(G) with |A|+|B|≤n there exists a vertex in V(G)\(A∪B) which is adjacent to each vertex in A and to no vertex in B. In this paper we study the n-existential closure property of block intersection graphs of in

Existential closure of block intersectio

Existential closure of block intersection graphs of infinite designs having finite block size and index

✍ David A. Pike; Asiyeh Sanaei 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

In this article we study the n-existential closure property of the block intersection graphs of infinite t-(v, k, k) designs for which the block size k and the index k are both finite. We show that such block intersection graphs are 2-e.c. when 2 ≤ t ≤ k-1. When k = 1 and 2 ≤ t ≤ k, then a necessary