𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The size Ramsey number of a complete bipartite graph

✍ Scribed by P. Erdo˝s; C.C. Rousseau

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
240 KB
Volume
113
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Erd6s. P. and C.C. Rousseau, The size Ramsey number of a complete bipartite graph, Discrete Mathematics 113 (1993) 259-262.

In this note we prove that the (diagonal) size Ramsey number of K,,.,, is bounded below by $2'2".

📜 SIMILAR VOLUMES

The maximal number of induced complete b
The maximal number of induced complete bipartite graphs
✍ Béla Bollobás; Chiê Nara; Shun-ichi Tachibana 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 230 KB

The aim of this paper is to determine the maximal number of induced K(t, t) subgraphs in graphs of given order and in graphs of given size. Given a graph G and a natural number t, denote by ft(G) the number of induced subgraphs of G isomorphic to K(t, t). Our notation is that of ; in particular, K(

On the bipartite independence number of
On the bipartite independence number of a balanced bipartite graph
✍ Odile Favaron; Pedro Mago; Oscar Ordaz 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 603 KB

Venezuela Ap. 47567, Caracas Favaron, O., P. Mago and 0. Ordaz, On the bipartite independence number of a balanced bipartite graph, Discrete Mathematics 121 (1993) 55-63. The bipartite independence number GI aIp of a bipartite graph G is the maximum order of a balanced independent set of G. Let 6 b

The ramsey numbers for stripes and one c
The ramsey numbers for stripes and one complete graph
✍ Peter Lorimer 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB 👁 1 views

The Ramsey numbers M,,, n,P,, ..., n,P,), p > 2, are calculated. ## 1. Introduction One class of generalized Ramsey numbers that are known exactly are those for the graphs nP2 which consist of n disjoint paths of length 2; E. J. Cockayne and the author proved in 111 that d r(nlp2, ..., n d P 2 ) =