A short proof of the induced Ramsey theorem for hypergraphs

DOI10.1016/J.DISC.2015.09.019MaRDI QIDQ897310zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

hypergraphinduced Ramsey theorempartite lemma

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3470438 (Why is no real title available?)
• scientific article; zbMATH DE number 3487493 (Why is no real title available?)
• scientific article; zbMATH DE number 3508544 (Why is no real title available?)
• Models Without Indiscernibles
• On a Probabilistic Graph-Theoretical Method
• Partitions of finite relational and set systems
• Partitionstheoreme für Graphen
• Regularity and Positional Games
• Strong Ramsey Theorems for Steiner Systems

Cited in

(6)

• On induced Ramsey numbers for \(k\)-uniform hypergraphs
• 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.
• 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)