✦ LIBER ✦

Lower bounds on mt(r, s)

✍ Scribed by A.C Mukhopadhyay

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 573 KB
Volume: 25
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(78)90026-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds on cube simplexity

✍ Robert B. Hughes 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 856 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

The lower bounds on distributed shortest

The lower bounds on distributed shortest paths

✍ K.V.S. Ramarao; S. Venkatesan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 507 KB

Lower bounds for lower Ramsey numbers

✍ Ralph Faudree; Ronald J. Gould; Michael S. Jacobson; Linda Lesniak 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

## Abstract For any graph __G__, let __i__(__G__) and μ;(__G__) denote the smallest number of vertices in a maximal independent set and maximal clique, respectively. For positive integers __m__ and __n__, the lower Ramsey number __s__(__m, n__) is the largest integer __p__ so that every graph of or

Shift graphs and lower bounds on Ramsey

Shift graphs and lower bounds on Ramsey numbers rk(l; r)

✍ Dwight Duffus; Hannon Lefmann; Vojtěch Rödl 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 380 KB

In this note we will obtain some lower bounds for the Ramsey numbers rk(l;r), where rk(l;r ) is the least positive integer n such that for every coloring of the k-element subsets of an n-element set with r colors there always exists an/-element set, all of whose k-element subsets are colored the sam

Improved lower bounds on k-independence

✍ Yair Caro; Zsolt Tuza 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB

## Abstract A vertex set __Y__ in a (hyper)graph is called __k__‐independent if in the sub(hyper)‐graph induced by __Y__ every vertex is incident to less than __k__ edges. We prove a lower bound for the maximum cardinality of a __k__‐independent set—in terms of degree sequences—which strengthens an