MathDB1 problem
- 0 votes0 replies0 views
The non-expanding links conjecture for bounded-degree graph sequences
Non-expanding links conjecture. There is no sequence of bounded-degree finite graphs, with size growing to infinity, such that all links in all the graphs form an expander family.