Erdős problem 1098 · problems.science

Let $G$ be a group and $\Gamma=\Gamma(G)$ be the non-commuting graph, with vertices the elements of $G$ and an edge between $g$ and $h$ if and only if $g$ and $h$ do not commute, $gh\neq hg$ .

Sources

Browse retained paths and inspect the exact material available for this Problem.

4 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

1098.lean

Retained formal statement4 of 4

FormalConjectures/ErdosProblems/1098.leanErdos1098.nonCommutingGraph_adj1 lineExact file

1∀ {G : Type u_1} [inst : Group G] (g h : G), (Erdos1098.nonCommutingGraph G).Adj g h ↔ g * h ≠ h * g

APIStatement only, no proof

Sources

Search problems.science