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 statement3 of 4

Neumann [Ne76] noted that if the centre has index $n$ then $\Gamma$ contains no complete subgraph on $>n$ vertices.

FormalConjectures/ErdosProblems/1098.leanErdos1098.erdos_1098.variants.upper_bound2 linesExact file

1∀ (G : Type u_1) [inst : Group G] [(Subgroup.center G).FiniteIndex],2  (Erdos1098.nonCommutingGraph G).CliqueFree ((Subgroup.center G).index + 1)

SolvedStatement only, no proof

Sources

Search problems.science