arXiv (All)
open access
Tight paths in fully directed hypergraphs
It is well-known that every tournament has a spanning path. We consider hypergraph analogues. In an \emph{$r$-uniform fully directed hypergraph}, or \emph{$r$-digraph}, every edge is a list or $r$ distinct vertices. An $(r,k)$-tournament is an $r$-digraph $G$ such that for every $r$-set $S$ of verti
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
- Extremal problems for cancellative and locally thin hypergraphs#986484
- Order and Gorenstein properties for lattice path matroid polytopes#820127
- Linear Tur'an Numbers of Four-Edge Uniform Paths via Incidence Rank#1033943
- Designing Efficient and Reachable Routes: The $k$-Step-Central Shortest Path Problem#670634
- Designing Efficient and Reachable Routes: The $k$-Step-Central Shortest Path Problem#668569
Record · ID 821761
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