Almost balanced biased graph representations of frame matroids

被引：2

作者：

DeVos, Matt

Funk, Daryl

机构：

来源：

ADVANCES IN APPLIED MATHEMATICS | 2018年 / 96卷

关键词：

D O I：

10.1016/j.aam.2017.12.003

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Given a 3-connected biased graph Omega with a balancing vertex, and with frame matroid F(Omega) nongraphic and 3-connected, we determine all biased graphs Omega' with F(Omega) = F(Omega). As a consequence, we show that if M is a 4-connected nongraphic frame matroid represented by a biased graph Omega having a balancing vertex, then Omega essentially uniquely represents M. More precisely, all biased graphs representing M are obtained from Omega by replacing a subset of the edges incident to its unique balancing vertex with unbalanced loops. (C) 2018 Elsevier Inc. All rights reserved.

引用

页码：139 / 175

页数：37

共 18 条

[1]

[Anonymous], 1973, J. Combin. Theory, Ser. B, DOI [10.1016/S0095-8956(73)80007-3, DOI 10.1016/S0095-8956(73)80007-3]

[2]

[Anonymous], THESIS

[3] Graphical Representations of Graphic Frame Matroids [J].