A Canonical Ramsey Theorem

DOI10.1002/RSA.3240030406MaRDI QIDQ4019375zbMATH OpenOpenAlexFDO

Authors Nancy Eaton, Vojtěch Rödl

Publication date 16 January 1993

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.3240030406

zbMATH Keywords

coloringprojective planeRamsey theoryselective graph

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Random graphs (graph-theoretic aspects) (05C80) Ramsey theory (05D10) Finite affine and projective planes (geometric aspects) (51E15)

Recommendations

• Induced Ramsey numbers
• Ramsey Theorems for Multiple Copies of Graphs
• Sharp bounds for some multicolour Ramsey numbers
• Lower bounds for lower Ramsey numbers
• On two problems in graph Ramsey theory

Cites work

• Colour Classes for r-Graphs
• On Partitioning Planar Graphs

Cited in

(10)

• Unordered canonical Ramsey numbers
• The minimum independence number for designs
• On induced Folkman numbers
• scientific article; zbMATH DE number 3825881 (Why is no real title available?)
• Some remarks on vertex Folkman numbers for hypergraphs
• Vertex Folkman numbers and the minimum degree of minimal Ramsey graphs
• The canonical Ramsey theorem and computability theory
• New Upper Bound on Vertex Folkman Numbers
• On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
• An almost quadratic bound on vertex Folkman numbers

This page was built for publication: A Canonical Ramsey Theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4019375)