Complete bipartite graphs without small rainbow subgraphs
From MaRDI portal
Recommendations
Cites work
- A bipartite Ramsey problem and the Zarankiewicz numbers
- A new upper bound for the bipartite Ramsey problem
- A Ramsey-type problem in directed and bipartite graphs
- Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings
- Asymptotic bounds for bipartite Ramsey numbers
- Bipartite rainbow Ramsey numbers.
- Bounds for bipartite rainbow Ramsey numbers
- Complete bipartite graphs without small rainbow stars
- Complete graphs and complete bipartite graphs without rainbow path
- Complete graphs with no rainbow path
- Diagonal forms and zero-sum (mod 2) bipartite Ramsey numbers
- Edge colorings of complete graphs without tricolored triangles
- Extensions of Gallai-Ramsey results
- Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs
- Gallai-Ramsey number for the union of stars
- Gallai-Ramsey numbers involving a rainbow 4-path
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 3520445 (Why is no real title available?)
- Lambda composition
- Mono-multi bipartite Ramsey numbers, designs, and matrices
- Multicolor bipartite Ramsey number of \(C_{4}\) and large \(K_{n, n}\)
- On finite Ramsey numbers
- On size Ramsey numbers of graphs with bounded degree
- Path-path Ramsey type numbers for the complete bipartite graph
- Ramsey and Gallai-Ramsey number for wheels
- Ramsey functions involving \(K_{m,n}\) with \(n\) large
- Ramsey numbers for local colorings
- Transitiv orientierbare Graphen
This page was built for publication: Complete bipartite graphs without small rainbow subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153477)
