Talk:Apollonian network
 | 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.
Start a discussion about improving the Apollonian network page
Talk pages are where people discuss how to make content on Wikipedia the best that it can be. You can use this page to start a discussion with others about how to improve the "Apollonian network" page.
