Bérczi–Chandrasekaran conjecture on head-disjoint hypergraph orientations
Bérczi–Chandrasekaran conjecture on head-disjoint hypergraph orientations
Let be a -uniform hypergraph. For , let be the sum of over all hyperedges separated by , meaning and . A strongly connected orientation of designates one vertex of each hyperedge as its head, with every nonempty having a hyperedge whose head lies in and which also contains a vertex outside . Two orientations are head-disjoint when no hyperedge has the same head in both orientations. Bérczi–Chandrasekaran's conjecture. If for every nonempty , then has pairwise head-disjoint strongly connected orientations. This is presented as an unpublished conjecture extending the graph case to general uniform hypergraphs; the supplied text gives no resolution.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Ahmad Abdi, Gérard Cornuéjols, Siyue Liu and Olha Silina, “Strongly connected orientations and integer lattices”, arXiv:2410.13665 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.