Detachments of amalgamated 3-uniform hypergraphs: factorization consequences

DOI10.1002/JCD.21310zbMATH Open1258.05087arXiv1710.03847OpenAlexW3123713780MaRDI QIDQ4906045FDOQ4906045

Authors: M. A. Bahmanian 

Publication date: 21 February 2013

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Abstract: A detachment of a hypergraph $scrF$ is a hypergraph obtained from $scrF$ by splitting some or all of its vertices into more than one vertex. Amalgamating a hypergraph $scrG$ can be thought of as taking $scrG$, partitioning its vertices, then for each element of the partition squashing the vertices to form a single vertex in the amalgamated hypergraph $scrF$. In this paper we use Nash-Williams lemma on laminar families to prove a detachment theorem for amalgamated 3-uniform hypergraphs, which yields a substantial generalization of previous amalgamation theorems by Hilton, Rodger and Nash-Williams. To demonstrate the power of our detachment theorem, we show that the complete 3-uniform $n$-partite multi-hypergraph $lambda{K}_{m_1,ldots,m_n}^3$ can be expressed as the union $scr{G}_{1}cupldotscupscr{G}_k$ of $k$ edge-disjoint factors, where for $i=1,ldots,k$, $scr{G}_i$ is $r_i$-regular, if and only if (i) $m_i=m_j:=m$ for all $1leqi,jleqk$, (ii) $3$ divides $r_{i}mn$ for each $i$, $1leqileqk$, and (iii) $$.

Full work available at URL: https://arxiv.org/abs/1710.03847

Recommendations

• Detachments of hypergraphs I: The Berge-Johnson problem
• Amalgamations of almost regular edge-colourings of simple graphs
• Embedding factorizations for 3-uniform hypergraphs
• scientific article; zbMATH DE number 7283879
• Connected Baranyai's theorem

zbMATH Keywords

decompositionfactorizationamalgamationsdetachments3-uniform hypergraphslaminar families

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Amalgamations of almost regular edge-colourings of simple graphs
• Hamilton decompositions of complete graphs with a 3-factor leave.
• Title not available (Why is that?)
• Generalized latin rectangles. II: Embedding
• Amalgamations of connected \(k\)-factorizations.
• Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of k_kn+1
• Amalgamations of factorizations of complete graphs
• Connected Detachments of Graphs and Generalized Euler Trails
• Hamiltonian decompositions of complete regular s-partite graphs
• Generalized latin rectangles I: Construction and decomposition
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• Hamiltonian decompositions of complete graphs
• On A Particular Conference Scheduling Problem
• The edge-coloring of complete hypergraphs. I
• Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
• Highly edge-connected detachments of graphs and digraphs
• Title not available (Why is that?)
• Hamilton decompositions of complete multipartite graphs with any 2‐factor leave

Cited In (6)

• Connected Baranyai's theorem
• Embedding connected factorizations
• On almost-regular edge colourings of hypergraphs
• Symmetric Layer-Rainbow Colorations of Cubes
• Detachments of hypergraphs I: The Berge-Johnson problem
• Factorizations of complete multipartite hypergraphs

This page was built for publication: Detachments of amalgamated 3-uniform hypergraphs: factorization consequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4906045)