Cliques in Steiner systems

DOI10.2478/S12175-008-0112-1MaRDI QIDQ3601028zbMATH OpenOpenAlexFDO

Authors Andrzej Dudek, Frantisek Franek, Vojtěch Rödl

Publication date 9 February 2009

Published in Mathematica Slovaca (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.2478/s12175-008-0112-1

zbMATH Keywords

Ramsey theoremSteiner systems

Mathematics Subject Classification ID

Hypergraphs (05C65) Ramsey theory (05D10)

Recommendations

• Strong Ramsey Theorems for Steiner Systems
• On the independence number of Steiner systems
• Note on independent sets in steiner systems
• scientific article; zbMATH DE number 1462936
• Some inequalities for Steiner systems

Cites work

• Coloring Steiner Triple Systems
• More-than-nearly-perfect packings and partial designs
• Nearly perfect matchings in regular simple hypergraphs
• The minimum independence number for designs

Cited in

(6)

• A note on simplicial cliques
• Nearly optimal partial Steiner systems
• Strong Ramsey Theorems for Steiner Systems
• Note on independent sets in steiner systems
• scientific article; zbMATH DE number 1462936 (Why is no real title available?)
• On the independence number of Steiner systems

This page was built for publication: Cliques in Steiner systems

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