arXiv (All)
open access
Forbidden Subgraphs of Graphs with Low Bandwidth
A layout of a graph G is an injective function $f : V(G) \rightarrow Z$, and the bandwidth of a layout f is $bw(G,f) = max_{uv \in E(G)} |f(u) - f(v)|$. The bandwidth bw(G) of G is the minimum bandwidth of a layout of G. Computing the bandwidth of a graph is a notoriously hard problem: assuming P !=
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 Counterexample to Teschner's Bondage-Number Conjecture#927557
- The Erdős Matching Conjecture for 4-uniform hypergraphs#1070833
- Spectral Extremal Graphs without a $K_k$-Factor#1035928
- Pathwidth-One Vertex Explosion and Co-Path Problems#1115918
- Extremal problems for cancellative and locally thin hypergraphs#986484
Record · ID 822364
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