1. Unavoidable vertex-minors for large prime graphs O-joung Kwon, KAIST (This is a joint work with Sang-il Oum) Discrete Seminar in KAIST 1 October 4, 2013. 1

2. - Ramsey type theorems - Rank-connectivity - Main Theorem 1) Blocking sequences Ladders 2) Ramsey type argument Brooms - What is next? 2

3. 3

4. 4 What if we add some connectivity assumtion?

5. 5 Otherwise, the graph has bounded degree, so it must contain a long induced path. ■

6. 6

7. 7

8. 8 Over GF 2 !

9. 9

10. 10 Def. A prime graph is a graph having no split. (We sometimes call 2-rank connected)

11. 11

13. 13 * Local complementation preserves the cut-rank of all vertex subsets.

14. 14

15. 15

16. 16

17. 17 Question. Whole graph is prime, but we have an induced subgraph which have a split. What can we say about the outside world?

18. 18

19. 19

21. Assuming existence of a long induced path. Object : obtaining a sufficiently long induced cycle. …

22. 22

24. 24

25. … 25

26. : Ladder : Generalized ladder => an induced cycle of length n ■ 26

27. 27

28. 28

29. 29

30. 30

31. 31

32. 32 By Ramsey Theorem, we may assume that second vertices form a clique or an independent set.

33. 33 1) K n 2) I n

34. 34 1) K n 2) I n case is similar with K n case

35. 35 1,2) It is equivalent to a path (w.r.t local complementations).

36. 36

37. 37 Def. Linear rank-width of graphs is a complexity measure of graphs using the cut-rank function.

38. 38 Prime notion is 2-rank connectivity. What will 3-rank connectivity say? Reduce the bound or find a simpler proof of our Theorem. ■

39. 39