Embedding connected factorizations
DOI10.1016/j.jctb.2022.03.002zbMath1487.05203OpenAlexW4225740432MaRDI QIDQ2131871
Stefan Napirata, Anna Johnsen, M. Amin Bahmanian
Publication date: 27 April 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2022.03.002
Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connected Baranyai's theorem
- Hamiltonian decompositions of complete graphs
- Amalgamations of factorizations of complete graphs
- Amalgamations of connected \(k\)-factorizations.
- List-edge-colouring planar graphs with precoloured edges
- Extension from precoloured sets of edges
- On regular set systems containing regular subsystems
- On embedding incomplete symmetric Latin squares
- Extending factorizations of complete uniform hypergraphs
- Detachments of Hypergraphs I: The Berge–Johnson Problem
- Extending an edge-coloring
- Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of kkn+1
- Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences
- A Combinatorial Theorem with an Application to Latin Rectangles
- An existence theorem for latin squares
This page was built for publication: Embedding connected factorizations
