Constructing sparsest \(\ell\)-Hamiltonian saturated \(k\)-uniform hypergraphs for a wide range of \(\ell\) (Q2111195)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing sparsest \(\ell\)-Hamiltonian saturated \(k\)-uniform hypergraphs for a wide range of \(\ell\) |
scientific article |
Statements
Constructing sparsest \(\ell\)-Hamiltonian saturated \(k\)-uniform hypergraphs for a wide range of \(\ell\) (English)
0 references
28 December 2022
0 references
\(k\)-uniform \(n\)-vertex hypergraphs
0 references
maximally non-Hamiltonian graph
0 references
