Delphi.science

Temporal cliques admit linear spanners

Source: github.com/dracoanguis/soumission-linear-spanners/tree/f569…

Ethan Bargaud-Arm

Palomar Registrypalomar/PALOMAR-2026-11-17-000011Nov 17, 2026cs.DMscore 0

Lean 4 / Mathlib formalization of the theorem that every temporal clique on n vertices admits a temporal spanner with at most 7n edges. A temporal clique is the complete graph on a finite vertex set whose edges carry natural-number time labels, locally injective (two edges sharing an endpoint have distinct labels); a temporal spanner is a set of edges in which every vertex reaches every other one by a journey with non-decreasing labels. The result and its proof are due to Júlia Baligács (arXiv:2606.05156, 2026): the dismountability of Carnevale, Casteigts and Corsini (SAND 2025) reduces…

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-17-000011
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-17-000011/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-17-000011/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'