MathDB1 problem
Matching
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.
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.