Macaulay2 » Documentation
Packages » MatchingFields » isLinkage
next | previous | forward | backward | up | index | toc

isLinkage -- Test if a tope field is linkage

Description

Consider a tope field given by a collection of bipartite graphs. The tope field is said to be linkage if for each $k+1$-subset $S$ of $[n]$, the union of the edges of the bipartite graphs $G$ where the non-isolated left-vertices of $G$ are contained in $S$, is a forest.

Note that all coherent matching fields are linkage.

i1 : L = diagonalMatchingField(2,4);
i2 : isLinkage L

o2 = true

See also

Menu

Ways to use isLinkage:

  • isLinkage(GrMatchingField)
  • isLinkage(TopeField)

For the programmer

The object isLinkage is a method function.


The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/MatchingFields.m2:3184:0.