arXiv (All)
open access
Maximal Order Type and Width of the h-Preorder on Finite Labeled Trees
We establish tight bounds for the width and maximal order type of the h-preorder on Q-labeled trees in terms of the corresponding invariants of well-quasi-order Q.
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
- Types of well-founded trees and the homomorphism order#1049938
- Treewidth and the Product of Tree-Independence and Tree-Chromatic Numbers#1355331
- On the maximum degree and order of $K_t$-minor-free graphs with positive Lin--Lu--Yau curvature#1218498
- Branching Time, Fatalism, and Possibilities#723143
- Extremal problems about the order and size of nonhamiltonian locally linear graphs#144198
Record · ID 1296520
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