Skip to content
HALOWERK

Datenvertragswerk

interval graph endpoint order family

For one simple undirected graph on n 0..4 vertices 0..n-1 (edge_mask bits name lexicographic unordered pairs (u,v), u<v), finds every strict total order of its 2*n interval endpoints that represents exactly that graph by interval intersection. Token 2*v is LEFT(v), token 2*v+1 is RIGHT(v); all endpoints are distinct. Returns all endpoint_words in numeric lexicographic order, count and feasible. Non-interval graphs such as the 4-cycle give a known empty family.

POST https://datenvertrag.halowerk.com/v1/interval-graph-endpoint-order-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": 4
        },
        {
          "type": "null"
        }
      ]
    },
    "edge_mask": {
      "anyOf": [
        {
          "type": "integer",
          "minimum": 0,
          "maximum": 63
        },
        {
          "type": "null"
        }
      ]
    },
    "claim": {
      "anyOf": [
        {
          "type": "object",
          "properties": {
            "endpoint_words": {
              "type": "array",
              "items": {
                "type": "array",
                "items": {
                  "type": "integer",
                  "minimum": 0,
                  "maximum": 7
                },
                "minItems": 0,
                "maxItems": 8
              },
              "minItems": 0,
              "maxItems": 576
            },
            "count": {
              "type": "integer",
              "minimum": 0,
              "maximum": 577
            },
            "feasible": {
              "type": "boolean"
            }
          },
          "required": [
            "endpoint_words",
            "count",
            "feasible"
          ],
          "additionalProperties": false
        },
        {
          "type": "null"
        }
      ]
    }
  },
  "required": [
    "n",
    "edge_mask",
    "claim"
  ],
  "additionalProperties": false
}

Open original schema

Published input example

{
  "n": 0,
  "edge_mask": 0,
  "claim": {
    "endpoint_words": [
      []
    ],
    "count": 1,
    "feasible": true
  }
}

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 โ†’