arXiv (All)
open access
Polynomial Compressibility and Forbidden Oriented Forests
For a nonempty acyclic oriented graph $H$, let $p(H)$ be the order of a longest directed path and let $τ(H)$ be the least positive integer $n$ such that $H$ admits a homomorphism to every tournament of order $n$. For all $p\ge3$ and $g\ge1$, we construct a connected acyclic oriented graph $H$ with u
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
- Unavoidable induced subgraphs forced by graphs with many vertices of prescribed properties#1122975
- Perfect matching covers of claw-free cubic graphs#1156072
- Oriented paths with two blocks in bipartite oriented graphs#996747
- Stable Adams operations on $RO(C_2)$-graded homotopy groups#677441
- Stable Adams operations on $RO(C_2)$-graded homotopy groups#674244
Record · ID 1118312
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