arXiv (OAI Expanded)
open access
Poset dimension and maximum comparability degree
In 1986, Füredi and Kahn showed that the dimension $\dim(P)$ of any finite poset $P$ satisfies $\dim(P) = O(d \log^2 d)$, where $d$ is the maximum degree of the comparability graph of $P$. Scott and Wood more recently improved this bound to one of the form $d \log^{1+o(1)} d$. We show that $\dim(P)
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
- Sharp bounds for intervals in finite subgroup lattices#997233
- A Tight Second-Order Lower Bound for Routing Labels in Trees#1154933
- Clique covers and decompositions of cliques of graphs#1122901
- Lacunary $δ$-Discretised Spherical Maximal Operators#1082957
- A computer-assisted lower bound for Landau's constant#1048980
Record · ID 1123711
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