next | previous | forward | backward | up | top | index | toc | packages | Macaulay2 website
MatchingFields > isLinkage

isLinkage -- Test if a tope field is linkage

Synopsis

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

Ways to use isLinkage :

For the programmer

The object isLinkage is a method function.

Menu