Chung's 1988 bandwidth problems for graph structures
This entry tracks Chung's 1988 bandwidth problems for graph structures.
It provides a common framework linking geometric-probability thresholds to layout parameters and resolves several Chung problems asymptotically.
Latest development
The paper establishes a bandwidth–threshold correspondence under a growth condition and applies it to spanning structures, bounded-treewidth graphs, and bounded-genus graphs.
Editorial caveat
The result is a collection of scoped resolutions rather than a blanket solution of all bandwidth questions.
References
- High powers of grids in random geometric graphs and thresholds for wide spanning structures — arXiv — Alberto Espuny Díaz
Source: arXiv
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.