Forbidden properly edge-colored subgraphs that force large highly connected monochromatic subgraphs (Q2409532)
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 6789912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Forbidden properly edge-colored subgraphs that force large highly connected monochromatic subgraphs |
scientific article; zbMATH DE number 6789912 |
Statements
Forbidden properly edge-colored subgraphs that force large highly connected monochromatic subgraphs (English)
0 references
11 October 2017
0 references
monochromatic connectivity
0 references
edge-coloring
0 references
forbidden subgraph
0 references
6-cycle
0 references
0.890097439289093
0 references
0.8828461766242981
0 references
0.8663575053215027
0 references
0.854341447353363
0 references
0.8464112281799316
0 references
