The rainbow Erdős-Rothschild problem for the Fano plane

Abstract

The Fano plane is the unique linear 3-uniform hypergraph on seven vertices and seven hyperedges. It was recently proved that, for all $n\ge 8$, the balanced complete bipartite 3-uniform hypergraph on $n$ vertices, denoted by $B_n$, is the 3-uniform hypergraph on $n$ vertices with the largest number of hyperedges that does not contain a copy of the Fano plane. For sufficiently large $r$ and $n$, we show that $B_n$ admits the largest number of $r$-edge colorings with no rainbow copy of the Fano plane.

24 pages