Hameed's conjecture on semi-transitivity of Mycielski graphs
Statement
Let be a graph, and let denote its Mycielski graph. A graph is semi-transitive if it admits an acyclic orientation with no shortcut. Hameed's conjecture. For every graph , the graph is semi-transitive if and only if is a bipartite graph. Hameed proved this equivalence when is a comparability graph, while the assertion for arbitrary graphs remains open.
Record
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.