Datenvertragswerk
graph one factorization family
For one fully captured simple undirected graph on original labels0..n-1,n0..6, synthesize EVERY 1-FACTORIZATION: a PARTITION OF ALL ORIGINAL EDGES into edge-disjoint PERFECT matchings. Each factor covers EVERY original vertex exactly once. edge_mask uses lexicographic unordered pairs(0,1),(0,2),.; require mask<2^(n*(n-1)/2). A factor is its nonzero original-edge bitmask. Each factorization sorts its factor masks numerically; factorizations sort numeric lexicographically, returning the.
POST https://datenvertrag.halowerk.com/v1/graph-one-factorization-familyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| n | See schema | Yes | |
| edge_mask | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"n": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 6
},
{
"type": "null"
}
]
},
"edge_mask": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 32767
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"factorizations": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 32767
},
"minItems": 0,
"maxItems": 5
},
"minItems": 0,
"maxItems": 20
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 100
}
},
"required": [
"factorizations",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"n",
"edge_mask",
"claim"
],
"additionalProperties": false
}Published input example
{
"n": 0,
"edge_mask": 0,
"claim": {
"factorizations": [
[]
],
"count": 1
}
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.
More endpoints in this hub
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- Datenvertragswerk0.003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.