A short proof of the induced Ramsey theorem for hypergraphs

DOI10.1016/j.disc.2015.09.019zbMath1328.05115OpenAlexW2177627378MaRDI QIDQ897310

Vindya Bhat, Vojtěch Rödl

Publication date: 17 December 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.09.019

zbMATH Keywords

hypergraphinduced Ramsey theorempartite lemma

Mathematics Subject Classification ID

Hypergraphs (05C65) Generalized Ramsey theory (05C55)

Related Items (1)

A Ramsey class for Steiner systems

Cites Work

• Partitionstheoreme für Graphen
• Partitions of finite relational and set systems
• Strong Ramsey Theorems for Steiner Systems
• Regularity and Positional Games
• Models Without Indiscernibles
• On a Probabilistic Graph-Theoretical Method
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A short proof of the induced Ramsey theorem for hypergraphs