On the chromaticity of quasi linear hypergraphs (Q2637737)

An \(h\)-hypergraph \(H= (V, \mathcal{E})\), with each edge \(e\in\mathcal{E}\) being an \(h\)-element subset of the set \(V\) of vertices, is said to be quasi-linear if every two edges of \(H\) intersect in 0 or \(r\) vertices (\(r\geq 1\) and \(h\geq 2r+1\)). The main result of this paper is the following: if \(G\) and \(H\) are chromatically equivalent \(h\)-hypergraphs, \(H\) is quasi-linear and \(h\geq 3r-1\), then any two edges of \(G\) intersect in 0, 1 or \(r\) vertices and the result cannot be strengthened. This extends the corresponding result of the first author for linear hypergraphs (case \(r=1\)) [\textit{I. Tomescu}, J. Comb. Theory, Ser. B 72, No. 2, 229--235 (1998; Zbl 0914.05024)].