Partitioning infinite hypergraphs into few monochromatic Berge-paths (Q2175777)
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 7195239
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning infinite hypergraphs into few monochromatic Berge-paths |
scientific article; zbMATH DE number 7195239 |
Statements
Partitioning infinite hypergraphs into few monochromatic Berge-paths (English)
0 references
30 April 2020
0 references
graph partitioning
0 references
monochromatic cycle partitioning
0 references
infinite graphs
0 references
Berge-paths
0 references
0.8596854209899902
0 references
0.8404461145401001
0 references
0.8386886119842529
0 references
0.8295791149139404
0 references
0.8244129419326782
0 references
