𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a Ramsey-type problem

✍ Scribed by F. R. K. Chung

Publisher
John Wiley and Sons
Year
1983
Tongue
English
Weight
212 KB
Volume
7
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a Quasi-Ramsey problem
On a Quasi-Ramsey problem
✍ Paul Erdös; János Pach 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB

It is proved th2t if a graph G has at least cn log n vertices, then either G or its complement G contains a subgraph H with a t least n vertices and minimum degree a t least 1 V ( H ) I /2. This result is not far from being best possible, as is shown by a rather unusual random construction. Some rel

A Ramsey-type problem and the Turán numb
A Ramsey-type problem and the Turán numbers
✍ N. Alon; P. Erdős; D. S. Gunderson; M. Molloy 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

## Abstract For each __n__ and __k__, we examine bounds on the largest number __m__ so that for any __k__‐coloring of the edges of __K~n~__ there exists a copy of __K~m~__ whose edges receive at most __k−__1 colors. We show that for $k \ge \sqrt{n}\;+\,\Omega(n^{1/3})$, the largest value of __m__ i

On Ramsey-type positional games
On Ramsey-type positional games
✍ Jaroslav Nešetřil; Tomáš Valla 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 132 KB

## Abstract Beck introduced the concept of Ramsey games by studying the game versions of Ramsey and van der Waerden theorems. We contribute to this topic by investigating games corresponding to structural extensions of Ramsey and van der Waerden theorems—the theorem of Brauer, structural and restri

Independence numbers of locally sparse g
Independence numbers of locally sparse graphs and a Ramsey type problem
✍ Noga Alon 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB 👁 1 views

Let G = (V, E ) be a graph on n vertices with average degree t 2 1 in which for every vertex u E V the induced subgraph on the set of all neighbors of u is r-colorable. We show that the independence number of G is at least log t , for some absolute positive constant c. This strengthens a well-known

A generalization of a Ramsey-type theore
A generalization of a Ramsey-type theorem on hypermatchings
✍ Paul Baginski 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB

## Abstract For an __r__‐uniform hypergraph __G__ define __N__(__G__, __l__; 2) (__N__(__G__, __l__; ℤ~__n__~)) as the smallest integer for which there exists an __r__‐uniform hypergraph __H__ on __N__(__G__, __l__; 2) (__N__(__G__,__l__; ℤ~__n__~)) vertices with clique(__H__) < __l__ such that eve

On the Ramsey Problem for Multicolor Bip
On the Ramsey Problem for Multicolor Bipartite Graphs
✍ W.A Carnielli; E.L Monte Carmelo 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 85 KB

Given i, j positive integers, let K denote a bipartite complete graph and let i, j ## Ž . R m, n be the smallest integer a such that for any r-coloring of the edges of K r a, a one can always find a monochromatic subgraph isomorphic to K . In other m, n Ž . Ä 4 words, if a G R m, n then every mat