On Colourings of Hypergraphs Without Monochromatic Fano Planes
On Colourings of Hypergraphs Without Monochromatic Fano Planes
For k -uniform hypergraphs F and H and an integer r , let c r,F ( H ) denote the number of r -colourings of the set of hyperedges of H with no monochromatic copy of F , and let $c_{r,F}(n)=\max_{H\in\ccHn} c_{r,F}(H)$ , where the maximum runs over all k …