A few remarks on the theory of non-nilpotent graphs
Abstract
We prove a few results about non-nilpotent graphs of symmetric groups Sn -- namely that they have a Hamiltonian cycle and they satisfy a conjecture of Nongsiang and Saikia. The latter is likewise proven for alternating groups An. We also show that the class of non-nilpotent graphs does not have any ''local'' properties, ie. for every simple graph X there is a group G, such that its non-nilpotent graph has X as an induced subgraph.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.