𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Ramsey-type problem in directed and bipartite graphs

✍ Scribed by A. Gyárfás; J. Lehel

Publisher
Springer Netherlands
Year
1973
Tongue
English
Weight
290 KB
Volume
3
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Covers and strong covers in directed bip
Covers and strong covers in directed bipartite graphs
✍ K. Vidyasankar 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 355 KB

## Abstract Let __G__ be a finite graph with directed bipartition (__V__^+^, __V__^−^). Necessary and sufficient conditions are given for the existence of covers and strong covers that: (i) satisfy matching with respect to __V__^+^, and (ii) include a given set of edges that satisfies matching with

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 new upper bound for the bipartite Rams
A new upper bound for the bipartite Ramsey problem
✍ David Conlon 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB 👁 1 views

## Abstract We consider the following question: how large does __n__ have to be to guarantee that in any two‐coloring of the edges of the complete graph __K__~__n,n__~ there is a monochromatic __K__~__k,k__~? In the late 1970s, Irving showed that it was sufficient, for __k__ large, that __n__ ≥ 2^_

On a Ramsey-type problem
On a Ramsey-type problem
✍ F. R. K. Chung 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 212 KB