A construction for Ramsey numbers for \(K_{m,n}\)
From MaRDI portal
Publication:709236
DOI10.1016/j.ejc.2010.05.002zbMath1227.05195OpenAlexW2072450162MaRDI QIDQ709236
Publication date: 18 October 2010
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2010.05.002
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Graphs which contain all small graphs
- Norm-graphs: Variations and applications
- Bounds for Ramsey numbers of complete graphs dropping an edge
- Ramsey functions involving \(K_{m,n}\) with \(n\) large
- The Difference Between Consecutive Primes, II
- The ramsey number of k5 - e
- A Constructive Solution to a Tournament Problem
- Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers
This page was built for publication: A construction for Ramsey numbers for \(K_{m,n}\)