Skip to content
HALOWERK

Datenvertragswerk

equitable graph partition family

For a fully captured simple undirected graph on original labels0..n-1, n0..5, edge_mask bitpositions are lexicographic unordered pairs(0,1),(0,2),.,(n-2,n-1), with bit0 first. Generate ALL vertex set partitions for which any two vertices in one block have equal INTEGER neighbor counts into EACH block, including their own. Return the entire lexicographically sorted partitions family as restricted-growth assignment vectors: first block0 and each new block is the next integer. Aligned.

POST https://datenvertrag.halowerk.com/v1/equitable-graph-partition-family

Inputs

Fields of the published input schema
FieldTypeRequiredDescription
nSee schemaYes
edge_maskSee schemaYes
claimSee schemaYes
Show full input schema
{
  "type": "object",
  "properties": {
    "n": {
      "anyOf": [
        {
          "type": "integer",
          "minimum": 0,
          "maximum": 5
        },
        {
          "type": "null"
        }
      ]
    },
    "edge_mask": {
      "anyOf": [
        {
          "type": "integer",
          "minimum": 0,
          "maximum": 1023
        },
        {
          "type": "null"
        }
      ]
    },
    "claim": {
      "anyOf": [
        {
          "type": "object",
          "properties": {
            "partitions": {
              "type": "array",
              "items": {
                "type": "array",
                "items": {
                  "type": "integer",
                  "minimum": 0,
                  "maximum": 4
                },
                "minItems": 0,
                "maxItems": 5
              },
              "minItems": 1,
              "maxItems": 52
            },
            "quotients": {
              "type": "array",
              "items": {
                "type": "array",
                "items": {
                  "type": "array",
                  "items": {
                    "type": "integer",
                    "minimum": 0,
                    "maximum": 4
                  },
                  "minItems": 0,
                  "maxItems": 5
                },
                "minItems": 0,
                "maxItems": 5
              },
              "minItems": 1,
              "maxItems": 52
            },
            "count": {
              "type": "integer",
              "minimum": 0,
              "maximum": 52
            }
          },
          "required": [
            "partitions",
            "quotients",
            "count"
          ],
          "additionalProperties": false
        },
        {
          "type": "null"
        }
      ]
    }
  },
  "required": [
    "n",
    "edge_mask",
    "claim"
  ],
  "additionalProperties": false
}

Open original schema

Published input example

{
  "n": 0,
  "edge_mask": 0,
  "claim": {
    "partitions": [
      []
    ],
    "quotients": [
      []
    ],
    "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

All endpoints in this hub โ†’