We look at a graph property called reducibility which is closely related to a condition developed by Brown to evaluate Feynman integrals. We show for graphs with a fixed number of external momenta, that reducibility with respect to both Symanzik polynomials is graph minor closed. We also survey the known forbidden minors and the known structural results. This gives some structural information on those Feynman diagrams which are reducible.

中文翻译：

---

图形次要和费曼图的线性可约性

我们看一个称为可约性的图属性，它与布朗开发的评估费曼积分的条件密切相关。对于具有固定数量的外部动量的图，我们展示了关于两个 Symanzik 多项式的可约性是图小闭的。我们还调查了已知的禁用未成年人和已知的结构结果。这给出了可还原的费曼图的一些结构信息。