arXiv (All)
open access
Extremal arborescences in graph orientations
In this paper, we study the extremal number of arborescences over orientations of a fixed graph. We prove that every alternating orientation of a plane Eulerian multigraph minimizes the rooted arborescence count among its Eulerian orientations. We also prove that every tournament of odd order maximi
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
- Tractability of Hard Digraph Cut Problems on Eulerian Instances: Treewidth Reduction and Reducing CMSO to Unbreakable Eulerian Instances#1341751
- Weisfeiler-Leman on Graphs of Small Twin-Width / Irene Heinrich, Moritz Lichter, Klara Pakhomenko, Simon Raßmann#628986
- Extremal Lin--Lu--Yau Curvature: Graph Density, Girth, and Short Cycles#986002
- On Eigenvalue Bounds for Bounded Genus Graphs and Minor-Free Graphs#1105150
- A New Sufficient Condition for Oriented Graphs Determined by Their Generalized Skew Spectra#926349
Record · ID 1401077
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