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 this page instead for the normal view: Codegree threshold for tiling \(k\)-graphs with two edges sharing exactly \(\ell\) vertices |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Codegree threshold for tiling \(k\)-graphs with two edges sharing exactly \(\ell\) vertices |
scientific article |
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
