Open Research Index

A formal proof that crown graphs maximise the representation number of bipartite graphs

Matthew J. Colbrook, Catherine Drysdale

Palomar Registrypalomar/PALOMAR-2026-10-22-000009Oct 22, 2026math.COscore 0

Lean proofs of the sharp bipartite representation bound, crown extremality, and the supporting finite and structural results.

SourceRepositoryJSON

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-10-22-000009
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-22-000009/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-10-22-000009/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'