Multicolor Ramsey numbers of bipartite graphs and large books
From MaRDI portal
Publication:2689130
DOI10.1007/s00373-023-02623-1OpenAlexW4320039201MaRDI QIDQ2689130
Publication date: 9 March 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-023-02623-1
Cites Work
- Ramsey numbers of a fixed odd-cycle and generalized books and fans
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- On multicolor Ramsey numbers for complete bipartite graphs
- On three color Ramsey numbers \(R(C_4, C_4, K_{1, n})\)
- Cycles of even length in graphs
- On book-complete graph Ramsey numbers
- Ramsey numbers of several \(K_{t,s}\) and a large \(K_{m,n}\)
- Ramsey Graphs and Block Designs. I
- On ramsey numbers for books
- An Upper Bound on Zarankiewicz' Problem
- The Ramsey number of books
- On a problem of K. Zarankiewicz
- Large Book-Cycle Ramsey Numbers
This page was built for publication: Multicolor Ramsey numbers of bipartite graphs and large books
