加载中…
We prove a few results about non-nilpotent graphs of symmetric groups – namely that they have a Hamiltonian cycle and they satisfy a conjecture of Nongsiang and Saikia. The latter is likewise proven for alternating groups . We also show that the class of non-nilpotent graphs does not have any ‘‘local’’ properties, ie. for every simple graph there is a group , such that its non-nilpotent graph has as an induced subgraph.

生成讲解博客的中文版本

生成AI智能校验的中文版本