Large sets of t-designs and a Ramsey-type problem

MaRDI QIDQ5384264zbMATH OpenFDO

Authors András Gyárfás

Publication date 21 June 2019

Full work available at URL http://math.colgate.edu/~integers/s53/s53.pdf

zbMATH Keywords

Ramsey-type number hypergraph

Mathematics Subject Classification ID

Other designs, configurations (05B30) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Ramsey theory (05D10)

Recommendations

• Lower bounds for hypergraph Ramsey numbers
• On Ramsey numbers of uniform hypergraphs with given maximum degree
• Colorings of hypergraphs with large number of colors
• A survey of hypergraph Ramsey problems
• Colorings of hypergraphs with large number of colors

Cites work

• scientific article; zbMATH DE number 3677884 (Why is no real title available?)
• scientific article; zbMATH DE number 7069639 (Why is no real title available?)
• scientific article; zbMATH DE number 3224335 (Why is no real title available?)
• A generalization of Ramsey theory for graphs

Cited in

(8)

• Additional constructions to solve the generalized Russian cards problem using combinatorial designs
• Classification of some large sets and designs
• Some results on the existence of large sets of t‐designs
• The largest Erdős-Ko-Rado sets in \(2-(v,k,1)\) designs
• On the large sets of t-designs of size nine
• scientific article; zbMATH DE number 5054200 (Why is no real title available?)
• Large forbidden configurations and design theory
• The (t−1) $(t-1)$‐chromatic Ramsey number for paths

This page was built for publication: Large sets of \(t\)-designs and a Ramsey-type problem

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