Talk:Apollonian network
Jump to navigation
Jump to search
![]() | This article is rated B-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
|
"László Lovász and Michael D. Plummer have conjectured that a similar exponential lower bound holds more generally for every 3-regular graph without cut edges, but this remains unproven except in special cases such as this one."
This is not true anymore, there is a recent result http://arxiv.org/abs/1012.2878 solving the general case.