Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths (Q6046654)
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 7746551
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths |
scientific article; zbMATH DE number 7746551 |
Statements
Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths (English)
0 references
5 October 2023
0 references
Hamilton cycle
0 references
tight path
0 references
0.8097872138023376
0 references
0.7995300889015198
0 references
0.796169102191925
0 references
0.7959181070327759
0 references
0.7953834533691406
0 references
