Strong Ramsey Theorems for Steiner Systems

DOI10.2307/2000786zbMath0632.05040OpenAlexW4252500359MaRDI QIDQ3768932

Jaroslav Nešetřil, Vojtěch Rödl

Publication date: 1987

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2000786

zbMATH Keywords

partitionk-element subsetsk-uniform hypergraphinduced subhypergraphpartial Steiner (k,\(\ell )\)-system

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (9)

Ramsey degrees, labeled and unlabeled partitions ⋮ Metric spaces are Ramsey ⋮ The partite construction and Ramsey set systems ⋮ A Ramsey class for Steiner systems ⋮ A short proof of the induced Ramsey theorem for hypergraphs ⋮ On Ramsey graphs without bipartite subgraphs ⋮ All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms) ⋮ Random Ramsey graphs for the four-cycle ⋮ Finite presentation of homogeneous graphs, posets and Ramsey classes

This page was built for publication: Strong Ramsey Theorems for Steiner Systems