%0 Journal Article
%T A class of Ramsey-extremal hypergraphs
%J Transactions on Combinatorics
%I University of Isfahan
%Z 2251-8657
%A McKay, Brendan D.
%D 2017
%\ 09/01/2017
%V 6
%N 3
%P 37-43
%! A class of Ramsey-extremal hypergraphs
%K hypergraph
%K Ramsey number
%K size-Ramsey number
%R 10.22108/toc.2017.21468
%X In 1991, McKay and Radziszowski proved that, however each $3$-subset of a $13$-set is assigned one of two colours, there is some $4$-subset whose four $3$-subsets have the same colour. More than 25 years later, this remains the only non-trivial classical Ramsey number known for hypergraphs. In this article, we find all the extremal colourings of the $3$-subsets of a 12-set and list some of their properties. We also provide an answer to a question of Dudek, La Fleur, Mubayi and R"odl about the size-Ramsey numbers of hypergraphs.
%U https://toc.ui.ac.ir/article_21468_114fdfc65b03414f07a821ae0e7d6b38.pdf