Results 141 to 150 of about 21,746 (178)

Bounds for Bipartite Rainbow Ramsey Numbers

Graphs and Combinatorics, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Ye, Li, Yusheng
openaire   +1 more source

Some Bipartite Ramsey Numbers

Southeast Asian Bulletin of Mathematics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On Bipartite Graphs with Linear Ramsey Numbers

Combinatorica, 2001
The upper bound \(8(8\Delta)^{\Delta}n\) is proved for the Ramsey number of \(n\)-vertex bipartite graphs with largest degree \(\Delta\). This gives a \(2^{cn\log n}\) bound for the \(n\)-cube. In the other direction, probabilistic methods give the existence of a constant \(c>1\) such that for \(\Delta\geq 1\), \(n\geq \Delta+1\), unless \(\Delta=1 ...
Graham, R. L., Rödl, V., Ruciński, A.
openaire   +2 more sources

Ramsey Numbers of Complete Bipartite Graphs

Graphs and Combinatorics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Meng, Du, Bangwei
openaire   +1 more source

Long Paths in Bipartite Graphs and Path-Bistar Bipartite Ramsey Numbers

Graphs and Combinatorics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michitaka Furuya, Shun-ichi Maezawa, Kenta Ozeki   +2 more
openaire   +1 more source

Multicolor Ramsey Numbers of Bipartite Graphs and Large Books

Graphs and Combinatorics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Li, Yusheng Li, Ye Wang
openaire   +2 more sources

Hypergraph Packing and Sparse Bipartite Ramsey Numbers

Combinatorics, Probability and Computing, 2009
We prove that there exists a constant c such that, for any integer Δ, the Ramsey number of a bipartite graph on n vertices with maximum degree Δ is less than 2cΔn. A probabilistic argument due to Graham, Rödl and Ruciński implies that this result is essentially sharp, up to the constant c in the exponent.
openaire   +3 more sources

Bounds on Ramsey Numbers of Certain Complete Bipartite Graphs

Results in Mathematics, 2002
The authors study the two-color Ramsey numbers \(r(K_{l,m}, K_{l,n})\) for \(l\in\{ 3,4,5\}\), and \(m\approx n\), and for \(l=3\), \(m\) fixed, and \(n\) large. In the diagonal case, they improve the old upper bound on \(r(K_{l,n}, K_{l,n})\) from \textit{F. R. K. Chung} and \textit{R. L. Graham} [J. Comb. Theory, Ser.
Lortz, Roland, Mengersen, Ingrid
openaire   +1 more source

Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs

Graphs and Combinatorics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jiang, Tao, Salerno, Michael
openaire   +2 more sources

Random bipartite Ramsey numbers of long cycles

Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Meng, Li, Yusheng
openaire   +2 more sources