a class of ramseyextremal hypergraphs

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 rodl about the size-ramsey numbers of hypergraphs‎.