Bounds for bipartite rainbow Ramsey numbers
From MaRDI portal
Publication:2409541
Recommendations
Cites work
- An Upper Bound for Constrained Ramsey Numbers
- Bipartite rainbow Ramsey numbers.
- Constrained Ramsey numbers of graphs
- Edge-colorings of complete graphs that avoid polychromatic trees
- Finding a monochromatic subgraph or a rainbow path
- scientific article; zbMATH DE number 2059948 (Why is no real title available?)
- Mono-multi bipartite Ramsey numbers, designs, and matrices
- Multi-color Ramsey numbers of even cycles
- Norm-graphs: Variations and applications
- On pattern Ramsey numbers of graphs
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- Rainbow generalizations of Ramsey theory: A survey
Cited in
(9)- Bipartite rainbow Ramsey numbers.
- Complete graphs and complete bipartite graphs without rainbow path
- Upper bounds for two bipartite Ramsey numbers
- scientific article; zbMATH DE number 7144854 (Why is no real title available?)
- Asymptotic bounds for bipartite Ramsey numbers
- Complete bipartite graphs without small rainbow stars
- Complete bipartite graphs without small rainbow subgraphs
- The automorphism group of projective norm graphs
- Subgraphs of the projective norm graph
This page was built for publication: Bounds for bipartite rainbow Ramsey numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409541)