A construction for Ramsey numbers for K_m,n
From MaRDI portal
Publication:709236
Recommendations
- An explicit construction for a Ramsey problem
- scientific article; zbMATH DE number 4106899
- Some constructive bounds on Ramsey numbers
- Ramsey numbers of several \(K_{t,s}\) and a large \(K_{m,n}\)
- scientific article; zbMATH DE number 19188
- On the Ramsey number \(r(H+\overline{K_ n},K_ n)\)
- A constructive approach for the lower bounds on the Ramsey numbersR (s, t)
- A construction for Boolean cube Ramsey numbers
- scientific article; zbMATH DE number 1760755
- Some further results in Ramsey graph construction
Cites work
- A Constructive Solution to a Tournament Problem
- Bounds for Ramsey numbers of complete graphs dropping an edge
- Character sums and Ramsey properties of generalized Paley graphs
- Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers
- Graphs which contain all small graphs
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- Norm-graphs: Variations and applications
- Ramsey functions involving \(K_{m,n}\) with \(n\) large
- The difference between consecutive primes. II
- The ramsey number of k5 - e
Cited in
(6)- Three-color Ramsey numbers of \(K _{n }\) dropping an edge
- A note on a lower bound for \(r(K_{m,n})\)
- Off‐diagonal and asymptotic results on the Ramsey number r(K2,m,K2,n)
- scientific article; zbMATH DE number 786144 (Why is no real title available?)
- scientific article; zbMATH DE number 3893206 (Why is no real title available?)
- Ramsey numbers of complete bipartite graphs
This page was built for publication: A construction for Ramsey numbers for \(K_{m,n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709236)
