Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A Canonical Ramsey Theorem

From MaRDI portal
Publication:4019375
Jump to:navigation, search

DOI10.1002/rsa.3240030406zbMath0757.05081OpenAlexW1983124852MaRDI QIDQ4019375

Vojtěch Rödl, Nancy Eaton

Publication date: 16 January 1993

Published in: Random Structures and Algorithms (Search for Journal in Brave)

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


zbMATH Keywords

projective planeRamsey theorycoloringselective graph


Mathematics Subject Classification ID

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


Related Items

On induced Folkman numbers ⋮ The minimum independence number for designs ⋮ Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs ⋮ Some remarks on vertex Folkman numbers for hypergraphs ⋮ On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers ⋮ An almost quadratic bound on vertex Folkman numbers ⋮ New Upper Bound on Vertex Folkman Numbers



Cites Work

  • On Partitioning Planar Graphs
  • Colour Classes for r-Graphs
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4019375&oldid=17728495"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 February 2024, at 03:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki