Results 131 to 140 of about 4,692 (164)
Some of the next articles are maybe not open access.
Multicolored Bipartite Ramsey Numbers of Large Cycles
Acta Mathematicae Applicatae Sinica, English Series, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Shao-qiang, Peng, Yue-jian
openaire +3 more sources
Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs
Discrete Mathematics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Meng, Li, Yusheng
openaire +3 more sources
Some Generalized Bipartite Ramsey Numbers Involving Short Cycles
Graphs and Combinatorics, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ernst J Joubert
openaire +4 more sources
On the cycle-path bipartite Ramsey number
Discrete MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joubert, Ernst J., Henning, Michael A.
openaire +3 more sources
Some Bistar Bipartite Ramsey Numbers
Graphs and Combinatorics, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hattingh, Johannes H., Joubert, Ernst J.
openaire +1 more source
Bipartite anti‐Ramsey numbers of cycles
Journal of Graph Theory, 2004AbstractWe determine the maximum number of colors in a coloring of the edges of Km,n such that every cycle of length 2k 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.
Axenovich, Maria +2 more
openaire +2 more sources
Bipartite Ramsey Numbers of Cycles for Random Graphs
Graphs and Combinatorics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Meng, Li, Yusheng
openaire +1 more source
Bounds for Bipartite Rainbow Ramsey Numbers
Graphs and Combinatorics, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Ye, Li, Yusheng
openaire +1 more source
Southeast Asian Bulletin of Mathematics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Graphs and Combinatorics, 1991
Denote by \(br(G;k)\) the \(k\)-color bipartite Ramsey number of a bipartite graph \(G\), i.e. the minimum integer \(n\) such that in any \(k\)-coloring of the edges of \(K_{n,n}\) there is a monochromatic subgraph isomorphic to \(G\). In this note the author proved that \(br(C_ 4;3)=11\).
openaire +1 more source
Denote by \(br(G;k)\) the \(k\)-color bipartite Ramsey number of a bipartite graph \(G\), i.e. the minimum integer \(n\) such that in any \(k\)-coloring of the edges of \(K_{n,n}\) there is a monochromatic subgraph isomorphic to \(G\). In this note the author proved that \(br(C_ 4;3)=11\).
openaire +1 more source