Head-disjoint strongly connected orientations
Statement
An orientation of a hypergraph is a directed hypergraph obtained by choosing a single head-node in each hyperedge. We call a set of orientations of a hypergraph head-disjoint if none of the hyperedges have the same head-node in two of them. When does a 3-uniform hypergraph admit three head-disjoint strongly connected orientations?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.