On induced Ramsey numbers for k-uniform hypergraphs

DOI10.1002/RSA.20580MaRDI QIDQ3467577zbMATH OpenOpenAlexFDO

Authors Domingos Dellamonica, Steven La Fleur, Vojtěch Rödl

Publication date 3 February 2016

Published in Random Structures \& Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphinducedRamsey

Mathematics Subject Classification ID

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

Recommendations

• A note on induced Ramsey numbers
• A short proof of the induced Ramsey theorem for hypergraphs
• Induced Ramsey numbers
• On Ramsey numbers of uniform hypergraphs with given maximum degree
• Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs

Cites work

• Complete \(r\)-partite subgraphs of dense \(r\)-graphs
• Induced Ramsey numbers
• Models Without Indiscernibles
• On \(k\)-partite hypergraphs with the induced \(\epsilon \)-density property
• On extremal problems of graphs and generalized graphs
• On two problems in graph Ramsey theory
• Partitions of finite relational and set systems
• Regular Partitions of Hypergraphs: Counting Lemmas
• Some recent results on Ramsey-type numbers

Cited in

(6)

• A note on induced Ramsey numbers
• Induced universal hypergraphs
• The Erdős-Szekeres problem and an induced Ramsey question
• A short proof of the induced Ramsey theorem for hypergraphs
• On \(k\)-partite hypergraphs with the induced \(\epsilon \)-density property
• Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs

This page was built for publication: On induced Ramsey numbers for \(k\)-uniform hypergraphs

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