On the degree, size, and chromatic index of a uniform hypergraph (Q5961544)

It is proved that an intersecting \(k\)-uniform hypergraph \(H\) in which no two edges share more than \(t\) common vertices and having maximum vertex degree \(D\) has at most \((t-1+{1\over t})D\) edges, provided that \(D\) is sufficiently large in terms of \(k\). This is a special case of a more general conjecture formulated in the paper.