Complete bipartite graphs without small rainbow subgraphs
From MaRDI portal
Publication:6153477
DOI10.1016/j.dam.2023.12.020OpenAlexW4390291126MaRDI QIDQ6153477
Ingo Schiermeyer, Yaping Mao, Zhiqiang Ma, Meiqin Wei
Publication date: 14 February 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.12.020
Cites Work
- Unnamed Item
- Unnamed Item
- Mono-multi bipartite Ramsey numbers, designs, and matrices
- Ramsey numbers for local colorings
- On finite Ramsey numbers
- Path-path Ramsey type numbers for the complete bipartite graph
- Bipartite rainbow Ramsey numbers.
- Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings
- Ramsey and Gallai-Ramsey number for wheels
- Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs
- 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 functions involving \(K_{m,n}\) with \(n\) large
- Gallai-Ramsey number for the union of stars
- Extensions of Gallai-Ramsey results
- Multicolor bipartite Ramsey number of C4 and large Kn, n
- Complete graphs with no rainbow path
- A new upper bound for the bipartite Ramsey problem
- A bipartite Ramsey problem and the Zarankiewicz numbers
- Lambda composition
- Edge colorings of complete graphs without tricolored triangles
- Transitiv orientierbare Graphen
- Asymptotic bounds for bipartite Ramsey numbers
- On size Ramsey numbers of graphs with bounded degree
- Gallai-Ramsey numbers involving a rainbow 4-path
- Complete bipartite graphs without small rainbow stars
