http://archive.numdam.org/article/ITA_2006__40_2_371_0.pdf
https://www.elen.ucl.ac.be/Proceedings/esann/esannpdf/es2004-92.pdf
Is Hopfield networks applicable on finding cages?

几个比较容易突破的值：
1.C(8,5)=77，用11元环的补图作Voltage Lift的底图，用C7作Lifting Group.
2.C(8,5)=72，用K9作Voltage Lift的底图，用Q8作Lifting Group.
3.C(5,7)=150，用任何一个(5,5)Cage作底图，用C5作Lifting group.
当前最好结果：C(8,5)=80 C(5,7)=153

There are no (8,5) graphs with v<=67:
deepblue.lib.umich.edu/bitstream/handle/2027.42/24359/0000628.pdf;jsessionid=7B7FB8A6C6A2F191ECE49507CE106702?sequence=1
So V_min could be 68.

In bounded degree graphs, effective approximation algorithms are known with approximation ratios that are constant for a fixed value of the maximum degree; for instance, a greedy algorithm that forms a maximal independent set by, at each step, choosing the minimum degree vertex in the graph and removing its neighbors, achieves an approximation ratio of (Δ+2)/3 on graphs with maximum degree Δ.
听上去有点吓人