Characterizations of matroids with an element lying in a restricted number of circuits

Ping Li (), Lan Wang (), Yang Wu () and Hong-Jian Lai ()
Additional contact information
Ping Li: Beijing Jiaotong University
Lan Wang: Mudanjiang Normal University
Yang Wu: West Virginia University
Hong-Jian Lai: West Virginia University

Journal of Combinatorial Optimization, 2019, vol. 38, issue 3, No 14, 887-910

Abstract: Abstract A matroid M with a distinguished element $$e_0 \in E(M)$$ e 0 ∈ E ( M ) is a rooted matroid with $$e_0$$ e 0 being the root. We present a characterization of all connected binary rooted matroids whose root lies in at most three circuits, and a characterization of all connected binary rooted matroids whose root lies in all but at most three circuits. While there exist infinitely many such matroids, the number of serial reductions of such matroids is finite. In particular, we find two finite families of binary matroids $$\mathcal M_1$$ M 1 and $$\mathcal M_2$$ M 2 and prove the following. (i) For some $$e_0 \in E(M)$$ e 0 ∈ E ( M ) , M has at most three circuits containing $$e_0$$ e 0 if and only if the serial reduction of M is isomorphic to a member in $$\mathcal M_1$$ M 1 . (ii) If for some $$e_0 \in E(M)$$ e 0 ∈ E ( M ) , M has at most three circuits not containing $$e_0$$ e 0 if and only if the serial reduction of M is isomorphic to a member in $$\mathcal M_2$$ M 2 . These characterizations will be applied to show that every connected binary matroid M with at least four circuits has a 1-hamiltonian circuit graph.

Keywords: Excluded minor characterizations; Matroid circuit graph; Hamiltonian; 1-hamiltonian (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00426-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:38:y:2019:i:3:d:10.1007_s10878-019-00426-w

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-019-00426-w

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().