arXiv (All)
open access
Alternating Hamilton Paths and Cycles in Poset Products
We study alternating Hamilton paths and cycles in the comparability graphs of finite posets. We prove that if a finite poset $P$ with at least two elements admits an alternating Hamilton path, then $P\times B_r$ admits an alternating Hamilton cycle for every $r\ge2$, where $B_r$ is the Boolean latti
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
- A generalization of RSK to $d$-complete posets#1354804
- Formally Certifying the Vertex Set of a Polyhedron Faster than Informal Enumeration#1249193
- Maker-Breaker Largest Connected Subgraph Game in Trees#1090704
- Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem#924397
- Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem#920166
Record · ID 1343341
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