Cliques in Steiner systems

DOI10.2478/S12175-008-0112-1zbMATH Open1199.05320OpenAlexW1983016207MaRDI QIDQ3601028FDOQ3601028

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

Publication date: 9 February 2009

Published in: Mathematica Slovaca (Search for Journal in Brave)

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

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

zbMATH Keywords

Ramsey theoremSteiner systems

Mathematics Subject Classification ID

Hypergraphs (05C65) Ramsey theory (05D10)

Cites Work

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

Cited In (4)

• Nearly optimal partial Steiner systems
• On the independence number of Steiner systems
• A note on simplicial cliques
• Strong Ramsey Theorems for 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)