arXiv (All)
open access
On kernel Mengerian orientations of line multigraphs
A kernel of a digraph is an independent set $K$ such that every vertex outside $K$ has an arc to a vertex in $K$. We present a polyhedral description of kernels in clique-acyclic orientations of line multigraphs. Given a digraph $D$, let $FK(D)$ denote its fractional kernel polytope, and let $σ(D)$
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
- Tree packing and the graphic Additive Base Conjecture#1216409
- There is only one transitive Anosov flow (in dimension 3, with orientable foliations, up to bicontact padding and Goodman surgeries)#1536791
- A Tensor Critical Threshold in Cubic Spherical Kernel Graphs#1389718
- Sudoku Analogues of Baranyai's Theorem#1050164
- Beyond Trees: The Weighted Center Problem on Gromov Hyperbolic Graphs#347794
Record · ID 1533801
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