Crowns in linear $3$-graphs

Alvaro Carbonero, Willem Fletcher, Jing Guo +3

A \textit{linear $3$-graph}, $H=(V,E)$, is a set, $V$, of vertices together with a set, $E$, of $3$-element subsets of $V$, called edges, so that any two distinct edges intersec…