什么时候一个有偏见的图表来自一个群体标签?
When does a biased graph come from a group labelling?
摘要:
有偏图由图$G$和图$G$的一组不同的圈组成,称为平衡圈,其性质是没有θ子图恰好包含两个平衡圈。也许$G$上最自然的有偏图来自于定向$G$,然后用群$Γ$的元素标记$G$的边。在这种情况下,我们可以通过声明一个圈是平衡的来定义一个有偏图,如果它的边上的标签的乘积是单位元,约定我们对向后遍历的边取相反的值。我们的第一个结果给出了一个自然的拓扑特征所产生的有偏图群标号。在本文的第二部分中,我们利用这个定理构造了一些例外的有偏图。值得注意的是,我们证明了对于每个$m \ge 3$和$\ell$,在$m$的顶点上存在一个极小的不可群标号的有偏图,其中每对顶点至少由$\ell$边连接.最后,我们表明,这些结果扩展到给无限家庭的排除未成年人的某些家庭的框架和升降机拟阵。
英文摘要:
A biased graph consists of a graph $G$ together with a collection of distinguished cycles of $G$, called balanced cycles, with the property that no theta subgraph contains exactly two balanced cycles. Perhaps the most natural biased graphs on $G$ arise from orienting $G$ and then labelling the edges of $G$ with elements of a group $Γ$. In this case, we may define a biased graph by declaring a cycle to be balanced if the product of the labels on its edges is the identity, with the convention that we take the inverse value for an edge traversed backwards. Our first result gives a natural topological characterisation of biased graphs arising from group-labellings. In the second part of this article, we use this theorem to construct some exceptional biased graphs. Notably, we prove that for every $m \ge 3$ and $\ell$ there exists a minor minimal not group labellable biased graph on $m$ vertices where every pair of vertices is joined by at least $\ell$ edges. Finally, we show that these results extend to give infinite families of excluded minors for certain families of frame and lift matroids.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。