On the degree, size, and chromatic index of a uniform hypergraph (Q5961544)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 981648
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9261065
0 references
0.9227251
0 references
0.9026922
0 references
0.9002565
0 references
0 references
0.89753455
0 references
0.8944335
0 references
0.89216155
0 references
0.89178455
0 references
