Results 11 to 20 of about 4,692 (164)
Bipartite Ramsey numbers and Zarankiewicz numbers
Discrete Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Goddard, Wayne +2 more
openaire +3 more sources
3‐Color bipartite Ramsey number of cycles and paths [PDF]
Journal of Graph Theory, 2019 AbstractThe ‐color bipartite Ramsey number of a bipartite graph is the least integer for which every ‐edge‐colored complete bipartite graph contains a monochromatic copy of . The study of bipartite Ramsey numbers was initiated, over 40 years ago, by Faudree and Schelp and, independently, by Gyárfás and Lehel, who determined the 2‐color Ramsey number
Matija Bucić +2 more
openaire +4 more sources
Insect visitation patterns in diploid Centaurea aspera and its related allotetraploid and triploid hybrids: Similar rates but distinct assemblages. [PDF]
Am J BotAbstract Premise Polyploidy is key to plant evolution by contributing to speciation, diversification, and adaptability. However, the minority cytotype exclusion effect can limit the persistence of polyploids, which can be mitigated by reproductive barriers such as distinct insect visitation between cytotypes. In eastern Spain, the diploid C.
Garmendia A +3 more
europepmc +2 more sources
Lower bounds for Max-Cut in $H$-free graphs via semidefinite programming [PDF]
, 2020 For a graph $G$, let $f(G)$ denote the size of the maximum cut in $G$. The problem of estimating $f(G)$ as a function of the number of vertices and edges of $G$ has a long history and was extensively studied in the last fifty years.
Carlson, Charles +5 more
core +2 more sources
Ramsey properties of randomly perturbed graphs: cliques and cycles [PDF]
, 2020 Given graphs $H_1,H_2$, a graph $G$ is $(H_1,H_2)$-Ramsey if for every colouring of the edges of $G$ with red and blue, there is a red copy of $H_1$ or a blue copy of $H_2$.
Das, Shagnik, Treglown, Andrew
core +2 more sources
Discrete Mathematics, 2009 For bipartite graphs \(B_1\) and \(B_2\), the \textit{size bipartite Ramsey number} \(\widehat{br}(B_1, B_2)\) is the size of the smallest bipartite graph \(B\) such that in any \(2\)-coloring of the edges of \(B\) there will be copy of \(B_1\) in the first color or a copy of \(B_2\) in the second color.
Sun, Yuqin, Li, Yusheng
openaire +2 more sources
The bipartite Ramsey numbers $BR(C_8, C_{2n})$ [PDF]
Discrete Mathematics & Theoretical Computer ScienceFor the given bipartite graphs $G_1,G_2,\ldots,G_t$, the multicolor bipartite Ramsey number $BR(G_1,G_2,\ldots,G_t)$ is the smallest positive integer $b$ such that any $t$-edge-coloring of $K_{b,b}$ contains a monochromatic subgraph isomorphic to $G_i ...
Mostafa Gholami, Yaser Rowshan
doaj +1 more source
Multicolour Bipartite Ramsey Number of Paths
The Electronic Journal of Combinatorics, 2019 The k$-colour bipartite Ramsey number of a bipartite graph $H$ is the least integer $N$ for which every $k$-edge-coloured complete bipartite graph $K_{N,N}$ contains a monochromatic copy of $H$. The study of bipartite Ramsey numbers was initiated over 40 years ago by Faudree and Schelp and, independently, by Gyárfás and Lehel, who determined the $2 ...
Bucic, M, Letzter, S, Sudakov, B
openaire +6 more sources
What is Ramsey-equivalent to a clique? [PDF]
, 2013 A graph G is Ramsey for H if every two-colouring of the edges of G contains a monochromatic copy of H. Two graphs H and H' are Ramsey-equivalent if every graph G is Ramsey for H if and only if it is Ramsey for H'.
Fox, Jacob +4 more
core +1 more source
Short proofs of some extremal results [PDF]
, 2013 We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive combinatorics, have ...
Beck +11 more
core +5 more sources