A class of Ramsey-extremal hypergraphs

DOI10.22108/TOC.2017.21468MaRDI QIDQ5134529zbMATH OpenOpenAlexFDO

Authors Brendan D. McKay

Publication date 17 November 2020

Full work available at URL https://arxiv.org/abs/1608.07762

zbMATH Keywords

hypergraphRamsey numbersize-Ramsey number

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Hypergraphs (05C65)

Abstract: 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. Using the catalogue, we provide an answer to a question of Dudek, Fleur, Mubayi and R"odl about the size-Ramsey numbers of hypergraphs.

Recommendations

• scientific article; zbMATH DE number 432832
• Extremal problems in hypergraph colourings
• Hypergraph Ramsey numbers
• A survey of hypergraph Ramsey problems
• Colorations Extrêmes Dans Les Hypergraphes

Cites work

• R(4, 5) = 25
• scientific article; zbMATH DE number 432832 (Why is no real title available?)
• Isomorph-Free Exhaustive Generation
• N(4, 4; 3)≥13
• On the size-Ramsey number of hypergraphs
• Practical graph isomorphism. II.
• Small Ramsey numbers

Cited in

(5)

• Hedgehogs are not colour blind
• scientific article; zbMATH DE number 432832 (Why is no real title available?)
• scientific article; zbMATH DE number 3520446 (Why is no real title available?)
• Constructive Methods in Gallai-Ramsey Theory for Hypergraphs
• Triangle Ramsey numbers of complete graphs

Describes a project that uses

Uses Software

• Traces
• nauty

This page was built for publication: A class of Ramsey-extremal hypergraphs

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