arXiv (All)
open access
Feedback edge set in bipartite digraph
Let \(β(G)\) denote the minimum size of a feedback edge set of a digraph \(G\), and let \(γ(G)\) denote the number of unordered pairs of nonadjacent vertices. Motivated by the Chudnovsky--Seymour--Sullivan conjecture for \(3\)-free digraphs, we study the corresponding feedback-edge problem for bipar
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 $2$-Approximation for Directed Feedback Vertex Set in Locally Semicomplete and Quasi-Transitive Digraphs#1013334
- On Edge Coloring of Multigraphs#1082904
- A Chvátal--Erdős type condition for supereulerian digraphs with $α_{2}=4$#793324
- A Chvátal--Erdős type condition for supereulerian digraphs with $α_{2}=4$#789320
- A General Inequality for Walks in Graphs#999527
Record · ID 974038
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