Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles (Q5379835)
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 7066119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles |
scientific article; zbMATH DE number 7066119 |
Statements
Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles (English)
0 references
14 June 2019
0 references
hypergraph
0 references
loose cycle
0 references
monochromatic partitions
0 references
tight cycle
0 references
0.9641858339309692
0 references
0.8827050924301147
0 references
0.8781558275222778
0 references
0.8689302206039429
0 references
0.8608399629592896
0 references
