Open Research Index

Gallai's conjecture with two exceptional even vertices

Idris Ali Shaik

Palomar Registrypalomar/PALOMAR-2026-10-04-000006Oct 4, 2026math.COscore 0

Every connected finite simple graph admits an edge partition into at most ceil(|V(G)|/2) simple paths when at most two vertices of its induced even-degree graph have degree greater than three. One positive designated even vertex can be exposed twice at the ceiling budget. Two designated even vertices can be exposed twice simultaneously within floor(|V(G)|/2)+1 paths, giving simultaneous ceiling exposure at odd order. Exceptional and ordinary degrees are unrestricted. Simultaneous even-order ceiling exposure and the unrestricted Gallai conjecture are not claimed.

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