arXiv (All)
open access
Connected Fair Detachments of Hypergraphs II
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 colo
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Proper conflict-free choosability of sparse graphs with girth at least seven#998793
- Adjacent vertex distinguishing total chromatic number of graph products#926334
- Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound#200590
- Spectra and eigenspaces of branched covers of graphs induced by local factorisation#1118364
- Proper Conflict-Free Choosability for Graphs with Bounded Average Degree#794171
Record · ID 1216662
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive