Genus, thickness and crossing number of graphs encoding the generating properties of finite groups
英文摘要：
Assume that $G$ is a finite group and let $a$ and $b$ be non-negative integers. We define an undirected graph $Γ_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if and only $\langle x_1,\dots,x_a,y_1,\dots,y_b \rangle =G.$ Our aim is to estimate the genus, the thickness and the crossing number of the graph $Γ_{a,b}(G)$ when $a$ and $b$ are positive integers.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
