arXiv (All)
open access
A refinement of the edge theorem for order and chain polytopes
For a finite poset, we partition the edges of the order polytope and of the chain polytope into classes indexed by the connected convex subsets of the poset, and we establish that corresponding classes have the same cardinality. This yields a closed formula for the common number of edges, and it ide
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The $k$-color poset Ramsey number of the diamond is $2k$#1355463
- A Brooks-like result for graph powers $#983875
- A General Upper Bound on Multicolor Ordered Ramsey Numbers#1064619
- An asymptotically tight bound on oriented diameter#1201074
- A note on efficient k-limited broadcast domination in graphs#659009
Record · ID 1216788
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive