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 short proof of the restricted Ramsey theorem for finite set systems

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

DOI10.1016/0097-3165(89)90037-XzbMath0695.05051OpenAlexW1964821160MaRDI QIDQ909675

Bernd Voigt, Hans Jürgen Prömel

Publication date: 1989

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(89)90037-x


zbMATH Keywords

Ramsey theorem for finite set systems


Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Generalized Ramsey theory (05C55)


Related Items (2)

Fast growing functions based on Ramsey theorems ⋮ A proof of the bounded graph conjecture



Cites Work

  • Ramsey classes of set systems
  • Partitions of finite relational and set systems
  • Models Without Indiscernibles


This page was built for publication: A short proof of the restricted Ramsey theorem for finite set systems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:909675&oldid=12872594"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 16:55.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki