2022/05/06 by Qi Yan, Yan, Qi, Xian’an Jin +1
Computer Science · Mathematics · #05B35 #05C31 #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Combinatorics (math.CO) #Commutative Algebra and Its Applications #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.2205.03487
openalex publication_date 2022/05/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Recently, we introduced the twist polynomials of delta-matroids and gave a characterization of even normal binary delta-matroids whose twist polynomials have only one term and posed a problem: what would happen for odd binary delta-matroids? In this paper, we show that a normal binary delta-matroid whose twist polynomials have only one term if and only if each connected component of the intersection graph of the delta-matroid is either a complete graph of odd order or a single vertex with a loop.