isLinkage -- Test if a tope field is linkage

Synopsis

Usage:

result = isLinkage MF

result = isLinkage TF
Inputs:
- MF, an instance of the type GrMatchingField,
- TF, an instance of the type TopeField,
Outputs:
- result, a Boolean value,

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

Ways to use isLinkage :

isLinkage(GrMatchingField)
isLinkage(TopeField)

For the programmer

The object isLinkage is a method function.

isLinkage -- Test if a tope field is linkage

Synopsis

Description

See also

Ways to use isLinkage :

For the programmer

Menu