A construction for Ramsey numbers for K_m,n

DOI10.1016/J.EJC.2010.05.002zbMATH Open1227.05195OpenAlexW2072450162MaRDI QIDQ709236FDOQ709236

Yusheng Li, Lin Dong

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

Recommendations

• An explicit construction for a Ramsey problem
• scientific article
• 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

zbMATH Keywords

Ramsey number

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Cites Work

• The difference between consecutive primes. II
• Title not available (Why is that?)
• Character sums and Ramsey properties of generalized Paley graphs
• Norm-graphs: Variations and applications
• A Constructive Solution to a Tournament Problem
• Ramsey functions involving \(K_{m,n}\) with \(n\) large
• Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers
• Bounds for Ramsey numbers of complete graphs dropping an edge
• The ramsey number of k5 - e
• Graphs which contain all small graphs

Cited In (4)

• Three-color Ramsey numbers of \(K _{n }\) dropping an edge
• Off‐diagonal and asymptotic results on the Ramsey number r(K_2,m,K_2,n)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)