Exact results on the number of restricted edge colorings for some families of linear hypergraphs (Q4920648)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exact results on the number of restricted edge colorings for some families of linear hypergraphs |
scientific article; zbMATH DE number 6164619
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact results on the number of restricted edge colorings for some families of linear hypergraphs |
scientific article; zbMATH DE number 6164619 |
Statements
Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs (English)
0 references
21 May 2013
0 references
extremal problems
0 references
Turán graph
0 references
0.9270917773246764
0 references
0.85605788230896
0 references
0.8433235883712769
0 references
0.839394748210907
0 references
0.8215677738189697
0 references
