Linear hypergraph
= Linear hypergraph
A <hypergraph> is linear when two distinct <hypergraph edges> intersect in at most one <vertex of a hypergraph>. Equivalently, every pair of distinct <vertices of a hypergraph> has <hypergraph codegree> at most one. This restricts local overlap without bounding the <hypergraph chromatic number>: the <random alteration method> gives linear three-uniform <hypergraphs> of arbitrarily large <hypergraph chromatic number>.