Codegree threshold for tiling \(k\)-graphs with two edges sharing exactly \(\ell\) vertices (Q2287773)
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 7154660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Codegree threshold for tiling \(k\)-graphs with two edges sharing exactly \(\ell\) vertices |
scientific article; zbMATH DE number 7154660 |
Statements
Codegree threshold for tiling \(k\)-graphs with two edges sharing exactly \(\ell\) vertices (English)
0 references
21 January 2020
0 references
hypergraph
0 references
codegree
0 references
factor
0 references
0 references
0.8530640602111816
0 references
0.8522225618362427
0 references
0.8191224336624146
0 references
0.7881266474723816
0 references
0.7854304313659668
0 references
