delta-matroid

In mathematics, a delta-matroid or Δ-matroid is a family of sets obeying an exchange axiom generalizing an axiom of matroids. A non-empty family of sets is a delta-matroid if, for every two sets E and F in the family, and for every element e in their symmetric difference E\triangle F, there exists an f\in E\triangle F such that E\triangle\{e,f\} is in the family. For the basis sets of a matroid, the corresponding exchange axiom requires in addition that e\in E and f\in F, ensuring that E and F have the same cardinality. For a delta-matroid, either of the two elements may belong to either of the two sets, and it is also allowed for the two elements to be equal.{{r|chun}}

An alternative and equivalent definition is that a family of sets forms a delta-matroid when the convex hull of its indicator vectors (the analogue of a matroid polytope) has the property that every edge length is either one or the square root of two.{{Citation needed|reason=I cannot find any reference where this is proved|date=June 2025}}

Delta-matroids were defined by André Bouchet in 1987.{{r|bouchet}}

Algorithms for matroid intersection and the matroid parity problem can be extended to some cases of delta-matroids.{{r|bj|gim}}

Delta-matroids have also been used to study constraint satisfaction problems.{{r|ff}} As a special case, an even delta-matroid is a delta-matroid in which either all sets have even number of elements, or all sets have an odd number of elements. If a constraint satisfaction problem has a Boolean variable on each edge of a planar graph, and if the variables of the edges incident to each vertex of the graph are constrained to belong to an even delta-matroid (possibly a different even delta-matroid for each vertex), then the problem can be solved in polynomial time. This result plays a key role in a characterization of the planar Boolean constraint satisfaction problems that can be solved in polynomial time.{{r|kkr}}

References

{{reflist|refs=

{{citation

| last1 = Bouchet | first1 = André

| last2 = Jackson | first2 = Bill

| journal = Electronic Journal of Combinatorics

| mr = 1741336

| page = R14:1–R14:22

| title = Parity systems and the delta-matroid intersection problem

| url = https://www.combinatorics.org/Volume_7/Abstracts/v7i1r14.html

| volume = 7

| year = 2000| doi = 10.37236/1492

}}

{{citation

| last = Bouchet | first = André

| doi = 10.1007/BF02604639

| issue = 2

| journal = Mathematical Programming

| mr = 904585

| pages = 147–159

| title = Greedy algorithm and symmetric matroids

| volume = 38

| year = 1987}}

{{citation|url=http://matroidunion.org/?p=1882|title=Delta-matroids: Origins|date=July 13, 2016|first=Carolyn|last=Chun|work=The Matroid Union}}

{{citation

| last1 = Feder | first1 = Tomás

| last2 = Ford | first2 = Daniel

| doi = 10.1137/S0895480104445009

| issue = 2

| journal = SIAM Journal on Discrete Mathematics

| mr = 2257268

| pages = 372–394

| title = Classification of bipartite Boolean constraint satisfaction through delta-matroid intersection

| volume = 20

| year = 2006| citeseerx = 10.1.1.124.8355

}}

{{citation

| last1 = Geelen | first1 = James F. | authorlink = Jim Geelen

| last2 = Iwata | first2 = Satoru

| last3 = Murota | first3 = Kazuo

| doi = 10.1016/S0095-8956(03)00039-X

| issue = 2

| journal = Journal of Combinatorial Theory

| mr = 1983366

| pages = 377–398

| series = Series B

| title = The linear delta-matroid parity problem

| volume = 88

| year = 2003| doi-access = free

}}

{{citation

| last1 = Kazda | first1 = Alexandr

| last2 = Kolmogorov | first2 = Vladimir

| last3 = Rolínek | first3 = Michal

| arxiv = 1602.03124

| date = December 2018

| doi = 10.1145/3230649

| issue = 2

| journal = ACM Transactions on Algorithms

| pages = 22:1–22:33

| title = Even delta-matroids and the complexity of planar Boolean CSPs

| volume = 15}}

}}

Category:Matroid theory