1 problem

Let $G$ be a graph, and let $\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 gra…