𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Mono-multi bipartite Ramsey numbers, designs, and matrices

✍ Scribed by Paul N. Balister; András Gyárfás; Jenoő Lehel; Richard H. Schelp

Book ID
108167166
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
162 KB
Volume
113
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bipartite anti-Ramsey numbers of cycles
Bipartite anti-Ramsey numbers of cycles
✍ Maria Axenovich; Tao Jiang; André Kündgen 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 265 KB

## Abstract We determine the maximum number of colors in a coloring of the edges of __K~m,n~__ such that every cycle of length 2__k__ contains at least two edges of the same color. One of our main tools is a result on generalized path covers in balanced bipartite graphs. For positive integers __q__

Extremal theory and bipartite graph-tree
Extremal theory and bipartite graph-tree Ramsey numbers
✍ P. Erd'́os; R.J. Faudree; C.C. Rousseau; R.H. Schelp 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 675 KB

For a positive integer n and graph E, fs(n) is the least integer m such that any graph of order n and minimal degree m has a copy of B. It will be show that if B is a bipartite graph with parts of order k and 1 (k G I), then there exists a positive constant c, such that for any tree T,, of order II

Multicolor bipartite Ramsey number of C4
Multicolor bipartite Ramsey number of C4 and large Kn, n
✍ Qizhong Lin; Yusheng Li 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB

Let br k (C 4 ; K n,n ) be the smallest N such that if all edges of K N,N are colored by k +1 colors, then there is a monochromatic C 4 in one of the first k colors or a monochromatic K n,n in the last color. It is shown that br k (C 4 ; K n,n ) = (n 2 / log 2 n) for k ≥ 3, and br 2 (C 4 ; K n,n ) ≥

The characterization of zero-sum (mod 2)
The characterization of zero-sum (mod 2) bipartite Ramsey numbers
✍ Caro, Yair; Yuster, Raphael 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

Let G be a bipartite graph, with k|e(G). The zero-sum bipartite Ramsey number B(G, Z k ) is the smallest integer t such that in every Z k -coloring of the edges of K t,t , there is a zero-sum mod k copy of G in K t,t . In this article we give the first proof that determines B(G, Z 2 ) for all possib