Bounds for bipartite rainbow Ramsey numbers
From MaRDI portal
Publication:2409541
DOI10.1007/s00373-017-1794-3zbMath1371.05176OpenAlexW2619817656MaRDI QIDQ2409541
Publication date: 11 October 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-017-1794-3
Related Items
Complete graphs and complete bipartite graphs without rainbow path, Complete bipartite graphs without small rainbow stars, Complete bipartite graphs without small rainbow subgraphs
Cites Work
- Unnamed Item
- Rainbow generalizations of Ramsey theory: A survey
- On pattern Ramsey numbers of graphs
- Mono-multi bipartite Ramsey numbers, designs, and matrices
- Norm-graphs: Variations and applications
- Edge-colorings of complete graphs that avoid polychromatic trees
- Bipartite rainbow Ramsey numbers.
- Multi-color Ramsey numbers of even cycles
- Finding a monochromatic subgraph or a rainbow path
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- Constrained Ramsey numbers of graphs
- An Upper Bound for Constrained Ramsey Numbers