报告题目：Six-flows of signed graphs with frustration number three
报告摘要：Bouchet's 6-flow conjecture states that every flow-admissible signed graph admits a nowhere-zero 6-flow. Seymour's 6-flow theorem implies that the conjecture holds for signed graphs with all edge positive. Recently, Rollová et al. verified the conjecture for signed cubic graphs with two negative edges and satisfying that its underlying graph either contains a bridge, or is 3-edge-colorable, or is critical. Wang et al. extend the result of Rollová et al. to signed graphs with frustration number at most two. Here the frustration number of a signed graph is the smallest number of vertices whose deletion leaves a balanced signed graph. In this talk, we further extend these results, and confirm 6-flow conjecture for signed graphs with frustration number at most three.
报告地点：腾讯会议，ID:301 448 362