Complete bipartite graphs without small rainbow stars
From MaRDI portal
Publication:6094708
DOI10.1016/j.dam.2023.06.038arXiv2306.17607OpenAlexW4384162637MaRDI QIDQ6094708
Meiqin Wei, Meng Ji, Wei-zhen Chen, Yaping Mao
Publication date: 14 September 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2306.17607
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Gallai-Ramsey numbers for cycles
- Ramsey numbers for local colorings
- Path-path Ramsey type numbers for the complete bipartite graph
- Bipartite rainbow Ramsey numbers.
- Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings
- Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs
- Gallai-Ramsey numbers for graphs with chromatic number three
- Bounds for bipartite rainbow Ramsey numbers
- Complete graphs and complete bipartite graphs without rainbow path
- Diagonal forms and zero-sum (mod 2) bipartite Ramsey numbers
- A Ramsey-type problem in directed and bipartite graphs
- Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs
- Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles
- Extensions of Gallai-Ramsey results
- Ramsey-type results for Gallai colorings
- Finding a monochromatic subgraph or a rainbow path
- Complete graphs with no rainbow path
- Lambda composition
- Edge colorings of complete graphs without tricolored triangles
- Complete graphs with no rainbow tree
- Transitiv orientierbare Graphen
- Gallai-Ramsey numbers for graphs with five vertices of chromatic number four
- The Erdős–Gyárfás function with respect to Gallai‐colorings
This page was built for publication: Complete bipartite graphs without small rainbow stars
