arXiv (All)
open access
The Path Partition Conjecture and 3-(quasi-)Transitive Digraphs
A digraph $D = (V,E)$ is 3-transitive (respectively, 3-quasi-transitive) if whenever $(u,v,w,z)$ is a directed path of length 3, $(u,z) \in E$ (respectively, $(u,z) \in E$ or $(z,u) \in E$). These digraphs extend the concepts of transitive and quasi-transitive digraphs, respectively. For 3-transitiv
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 complete classification of metrizable and strictly metrizable theta graphs#987710
- P3.10 Recursive Reality Project - Structural Preconditions in Four-Dimensional Recursive Self-Reference#103201
- Sub-polynomial parameterized complexity of $k$-core#1051912
- Three-dimensional symmetric designs of propriety 3#1049691
- Non-Hamiltonian $\frac{3}{2}$-Tough Plane Triangulations#972337
Record · ID 1324818
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