A short proof of the induced Ramsey theorem for hypergraphs

DOI10.1016/J.DISC.2015.09.019zbMATH Open1328.05115OpenAlexW2177627378MaRDI QIDQ897310FDOQ897310

Authors: 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

Recommendations

• On induced Ramsey numbers for \(k\)-uniform hypergraphs
• A note on induced Ramsey numbers
• Induced Ramsey numbers
• Induced Ramsey-type theorems
• Induced Ramsey-type theorems

zbMATH Keywords

hypergraphinduced Ramsey theorempartite lemma

Mathematics Subject Classification ID

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

Cites Work

• Partitions of finite relational and set systems
• Strong Ramsey Theorems for Steiner Systems
• Models Without Indiscernibles
• Regularity and Positional Games
• Title not available (Why is that?)
• Title not available (Why is that?)
• On a Probabilistic Graph-Theoretical Method
• Title not available (Why is that?)
• Partitionstheoreme für Graphen

Cited In (6)

• A note on the induced Ramsey theorem for spaces
• A note on induced Ramsey numbers
• A Ramsey class for Steiner systems
• Proving Ramsey's theory by the cover set induction: A case and comparision study.
• On induced Ramsey numbers for \(k\)-uniform hypergraphs
• Induced partition properties of combinatorial cubes

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

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