arXiv (All)
open access
Bipartite edge frustration of nut graphs: proofs and constructions
The bipartite edge frustration of a graph $G$, $φ(G)$, is the minimum number of edges that must be removed from $G$ to obtain a graph that is bipartite. Core graphs are singular graphs on $2$ or more vertices, for which the kernel of the adjacency matrix contains a full eigenvector. A nut graph is a
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
- Lot 2 : Fourniture de machines à affranchir comprenant un logiciel de marquage industriel et prestations associées#215328
- Conjugating full cycles by adjacent transpositions: diameter and sorting time#925898
- Descent generating polynomials for ($n-3$)- and ($n-4$)-stack-sortable (pattern-avoiding) permutations#1082938
- Oriented Paths with Few Direction Flips Are Tournament Anti-Sidorenko#1084590
- Optimal Order of Multi-Agent and General Many-Body Systems#290613
Record · ID 1326929
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