On the degree, size, and chromatic index of a uniform hypergraph (Q5961544)
From MaRDI portal
scientific article; zbMATH DE number 981648
Language | Label | Description | Also known as |
---|---|---|---|
English | On the degree, size, and chromatic index of a uniform hypergraph |
scientific article; zbMATH DE number 981648 |
Statements
On the degree, size, and chromatic index of a uniform hypergraph (English)
0 references
18 August 1997
0 references
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.
0 references
degree
0 references
size
0 references
chromatic index
0 references
hypergraph
0 references