Edge-colorings of complete bipartite graphs without large rainbow trees (Q2931471)
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: Edge-colorings of complete bipartite graphs without large rainbow trees |
scientific article; zbMATH DE number 6373990
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge-colorings of complete bipartite graphs without large rainbow trees |
scientific article; zbMATH DE number 6373990 |
Statements
25 November 2014
0 references
anti-Ramsey number
0 references
rainbow
0 references
0.8929904699325562
0 references
0.8792279362678528
0 references
0.8792241811752319
0 references
0.8650659322738647
0 references
0.8628687262535095
0 references
