ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let μ(G)\mu(G) denote its Mycielski graph. A graph is semi-transitive if it admits an acyclic orientation with no shortcut. Hameed's conjecture. For every graph GG, the graph μ(G)\mu(G) is semi-transitive if and only if GG is a bipartite graph. Hameed proved this equivalence when GG 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.