Breuer–Guralnick–Kantor Hamiltonian generating-graph conjecture

About 9 years old · traced to

Let GG be a finite group with ∣G∣≥4|G|\geq 4, and let Γ(G)\Gamma(G) be its generating graph: the vertices are the non-identity elements, and xx and yy are adjacent exactly when G=⟨x,y⟩G=\langle x,y\rangle. Breuer–Guralnick–Kantor's Hamiltonicity conjecture.

Γ(G) contains a Hamiltonian cycle⟺G/N is cyclic for every nontrivial normal subgroup N of G.\Gamma(G)\text{ contains a Hamiltonian cycle}\quad\Longleftrightarrow\quad G/N\text{ is cyclic for every nontrivial normal subgroup }N\text{ of }G.

The cyclic-quotient condition is necessary, and the source reports the conjecture as proved for soluble groups and for groups L2(q){\rm L}_2(q), with substantial progress for alternating groups; the general assertion remains unresolved.

References

Primary source

Timothy C. Burness, “Simple groups, generation and probabilistic methods”, arXiv:1710.10434 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.