Embedding factorizations for 3-uniform hypergraphs II: r-factorizations into s-factorizations
From MaRDI portal
(Redirected from Publication:289992)
Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations
Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations
Recommendations
Cites work
- scientific article; zbMATH DE number 3478938 (Why is no real title available?)
- scientific article; zbMATH DE number 3520420 (Why is no real title available?)
- scientific article; zbMATH DE number 3563169 (Why is no real title available?)
- scientific article; zbMATH DE number 524129 (Why is no real title available?)
- Amalgamations of connected \(k\)-factorizations.
- Amalgamations of factorizations of complete graphs
- Detachments of hypergraphs I: The Berge-Johnson problem
- Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of kkn+1
- Embedding factorizations for 3-uniform hypergraphs
- Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations
- Generalized latin rectangles. II: Embedding
- On embedding incomplete symmetric Latin squares
Cited in
(7)- Embedding factorizations for 3-uniform hypergraphs
- Extending factorizations of complete uniform hypergraphs
- On regular set systems containing regular subsystems
- On almost-regular edge colourings of hypergraphs
- scientific article; zbMATH DE number 7283879 (Why is no real title available?)
- Factorizations of complete multipartite hypergraphs
- Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations
This page was built for publication: Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289992)