Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211...
37
Transcript of Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211...
![Page 1: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/1.jpg)
![Page 2: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/2.jpg)
![Page 3: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/3.jpg)
![Page 4: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/4.jpg)
![Page 5: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/5.jpg)
![Page 6: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/6.jpg)
![Page 7: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/7.jpg)
![Page 8: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/8.jpg)
![Page 9: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/9.jpg)
![Page 10: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/10.jpg)
![Page 11: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/11.jpg)
![Page 12: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/12.jpg)
![Page 13: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/13.jpg)
![Page 14: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/14.jpg)
![Page 15: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/15.jpg)
![Page 16: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/16.jpg)
![Page 17: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/17.jpg)
![Page 18: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/18.jpg)
![Page 19: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/19.jpg)
![Page 20: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/20.jpg)
![Page 21: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/21.jpg)
![Page 22: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/22.jpg)
![Page 23: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/23.jpg)
32 221 311 2111 11111
3111
2211 2111122242 411
321
111 21122 1111
33 111111
Figure 1. Graphs from partitions of N ≤ 6(omitting the stars Γ(n, 1) and the totally disconnected graphs Γ(n))
![Page 24: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/24.jpg)
![Page 25: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/25.jpg)
![Page 26: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/26.jpg)
![Page 27: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/27.jpg)
![Page 28: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/28.jpg)
![Page 29: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/29.jpg)
![Page 30: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/30.jpg)
![Page 31: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/31.jpg)
![Page 32: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/32.jpg)
![Page 33: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/33.jpg)
![Page 34: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/34.jpg)
![Page 35: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/35.jpg)
![Page 36: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/36.jpg)
![Page 37: Glamf/LMSworkshops/talks0809/boalch.pdf · 2008. 11. 9. · 32 221 311 2111 11111 3111 42 411 2211 21111222 321 111 21122 1111 33 111111 Figure 1. Graphs from partitions of N ≤](https://reader035.fdocuments.net/reader035/viewer/2022071302/60b113d3664f14020821a9f7/html5/thumbnails/37.jpg)