Richter and Salazar's bounded-bandwidth conjecture for crossing-critical graphs
A graph is -crossing-critical if its crossing number is at least , but every proper subgraph has crossing number smaller than . Richter and Salazar's conjecture. For every positive integer , there exists an integer such that every -crossing-critical graph has bandwidth at most .
References
Status
- Refuted: Zdeněk Dvořák and Bojan Mohar. Crossing-critical graphs with large maximum degree (Journal of Combinatorial Theory, Series B, 2010) https://doi.org/10.1016/j.jctb.2009.11.003
Source: Zdenek Dvorak and Bojan Mohar, “Crossing-critical graphs with large maximum degree”, arXiv:0907.1599 (2009).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.