Odd covers of complete graphs and hypergraphs

DOI10.1016/J.EJC.2025.104299MaRDI QIDQ6866242zbMATH OpenFDO

Authors Imre Leader, Ta Sheng Tan

Publication date 29 January 2026

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2025.104299

zbMATH Keywords

Graham-Pollak problemodd cover number

Mathematics Subject Classification ID

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

Cites work

• Bounds for the Graham-Pollak theorem for hypergraphs
• Decomposing the complete \(r\)-graph
• Decomposition of the complete r-graph into complete r-partite r-graphs
• Depth-3 arithmetic circuits for S_n^2(X) and extensions of the Graham-Pollack theorem
• scientific article; zbMATH DE number 3395950 (Why is no real title available?)
• Improved bounds for the Graham-Pollak problem for hypergraphs
• Odd covers of graphs
• On decompositions of complete hypergraphs
• On the Addressing Problem for Loop Switching

This page was built for publication: Odd covers of complete graphs and hypergraphs

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