Connected Fair Detachments of Hypergraphs II
Abstract
We study embeddings of factorizations of the λ-fold complete h-uniform hypergraph λKmh in factorizations of λKnh, where m<n and both the source and target degrees may vary by color. From every embedding one can obtain another that minimizes the number of components in every target color without increasing its multiplicity spread. This change also does not increase the sum of any convex function of the edge multiplicities, simultaneously in all colors. For h=2,3 we give exact existence criteria for every m<n. For h≥4, the necessary divisibility and degree-sum conditions are sufficient once n≥(h−1)m, improving the previously known threshold n≥ hm for color-dependent degrees. In this range we also give exact criteria for connected, simple, and equimultiple target factors. The proofs use a system of integer counts recording the number of added edges of each type. Every system satisfying these equations gives an embedding with the minimum multiplicity spread allowed by
Related
- The Turán number of Berge paths in connected hypergraphs
- General Constructions of Permutation-Fair Dice
- Asymptotic Max-Min Fair Allocation with Random Utilities
- An improved upper bound for the fair domination number of maximal outerplanar graphs
- There can be equitable social welfare orders but no fair voting system
BibTeX
@misc{bahmanian2026connected,
title = {{Connected Fair Detachments of Hypergraphs II}},
author = {Amin Bahmanian},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.07287},
eprint = {2610.07287},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.07287},
}
RIS
TY - UNPB
TI - Connected Fair Detachments of Hypergraphs II
AU - Amin Bahmanian
PY - 2026
DA - 2026/10/05
PB - arXiv
DO - 10.48550/arxiv.2610.07287
UR - https://arxiv.org/abs/2610.07287
AB - We study embeddings of factorizations of the λ-fold complete h-uniform hypergraph λK_m^h in factorizations of λK_n^h, where m<n and both the source and target degrees may vary by color. From every embedding one can obtain another that minimizes the number of components in every target color without increasing its multiplicity spread. This change also does not increase the sum of any convex function of the edge multiplicities, simultaneously in all colors. For h=2,3 we give exact existence criteria for every m<n. For h≥4, the necessary divisibility and degree-sum conditions are sufficient once n≥(h−1)m, improving the previously known threshold n≥ hm for color-dependent degrees. In this range we also give exact criteria for connected, simple, and equimultiple target factors. The proofs use a system of integer counts recording the number of added edges of each type. Every system satisfying these equations gives an embedding with the minimum multiplicity spread allowed by
ER -