1. Chromatic Ramsey Number and Circular Chromatic Ramsey Number Xuding Zhu Department of Mathematics Zhejiang Normal University

2. Among 6 people, There are 3 know each other, or 3 do not know each other. Know each other Do not know each other

3. Among 6 people, There are 3 know each other, or 3 do not know each other.

4. Among 6 people, There are 3 know each other, or 3 do not know each other.

5. Among 6 people, There are 3 know each other, or 3 do not know each other.

6. Among 6 people, There are 3 know each other, or 3 do not know each other. Colour the edges of by red or blue, there is either a red or a blue

7. Theorem [Ramsey] For any graphs G and H, there exists a graph F such that if the edges of F are coloured by red and blue, then there is a red copy of G or a blue copy of H For `any’ systems, there exists a system F such that if `elements’ of F are partitioned into k parts, then for some i, the ith part contains as a subsystem. General Ramsey Type Theorem: Sufficiently large or complicated

8. “Complete disorder is impossible” A sufficiently large scale (or complicated) system must contains an interesting sub-system.

9. There are Ramsey type theorems in many branches of mathematics such as combinatorics, number theory, geometry, ergodic theory, topology, combinatorial geometry, set theory, and measure theory. Ramsey Theory has a wide range of applications.

10. whenevertheelementsofsome (su ffi ciently large)objectare partitionedintoafinitenumberofclasses(i.e.,coloredwithafinitenumber ofcolors),thereisalwaysatleastone(color)classwhichcontainsallthe elementsofsomeregularstructure.Whenthisisthecase,oneadditionally wouldliketohavequantitativeestimatesofwhat “su ffi ciently large”means. Inthissense,theguidingphilosophyofRamseytheorycanbedescribedby thephrase:“Completedisorderisimpossible”. If the k-tuples M are t-colored, then Theorem [Ramsey, 1927] all the k-tuples of M’ having the same color.

11. For any partition of integers into finitely many parts, one part contains arithematical progression of arbitrary large length. Van der Waeden Theorem Szemerédi's theorem (1975) Every set of integers A with positive density contains arithematical progression of arbitrary length. Timonthy Gowers [2001] gave a proof using both Fourier analysis and combinatorics. Regularity lemma Erdos and Turan conjecture (1936) Harmonic analysis

12. Furstenberg[124]gaveergodictheoreticalandtopological dynamics reformulations. Ramsey number R(3,k)

13. For any 2-colouring of the edges of F with colours red and blue, there is a red copy of G or a blue copy of H. means.

14. The Ramsey number of (G,H) is

15. 1933, George Szekeres, Esther Klein, Paul Erdos starting with a geometric problem, Szekeres re-discovered Ramsey theorem, and proved

16. Erdos [1946] Erdos [1961] Graver-Yackel [1968] Ajtai-Komlos-Szemeredi [1980] Kim [1995] Szekere [1933] Many sophisticated probabilistic tools are developed

17. George Szekere and Esther Klein married lived together for 70 year, died on the same day 2005.8.28, within one hour.

19. Bounds for R(k,l) k l 345678 36914182328 4182536 41 49 61 58 84 543 49 58 87 80 143 101 216 6102 165 113 298 132 495 7205 540 217 1031 8282 1870

20. Bounds for R(k,l) k l 345678 36914182328 4182536 41 49 61 58 84 543 49 58 87 80 143 101 216 6102 165 113 298 132 495 7205 540 217 1031 8282 1870

21. Bounds for R(k,l) k l 345678 36914182328 4182536 41 49 61 58 84 543 49 58 87 80 143 101 216 6102 165 113 298 132 495 7205 540 217 1031 8282 1870

22. How to measure a system? A sufficiently large scale (or complicated) system must contains an interesting sub-system. What is large scale? What is complicated? How to measure a graph?

24. Chromatic number Circular chromatic number

25. G=(V,E): a graph an integer An k-colouring of G is 0 1 2 0 1 A 3-colouring of such that

26. The chromatic number of G is

27. G=(V,E): a graph an integer k-colouring of G is such that An a real number A (circular) 0 1 2 0.5 1.5 A 2.5-coloring r-colouring of G is

28. The circular chromatic number of G is { r: G has a circular r-colouring } infmin

29. f is k-colouring of G Therefore for any graph G, f is a circular k-colouring of G

30. 0=r 3 1 2 4 x~y |f(x)-f(y)|_r ≥ 1 The distance between p, p’ in the circle is f is a circular r-colouring if 0r p p’p’

31. Basic relation between and Circular chromatic number of a graph is a refinement of its chromatic number.

32. Graph coloring is a model for resource distribution Circular graph coloring is a model for resource distribution of periodic nature.

33. Introduced by Burr-Erdos-Lovasz in 1976

34. If F has chromatic number, then there is a 2 edge colouring of F in which each monochromatic subgraph has chromatic number n-1. for any n-chromatic G.

35. If F has chromatic number, then there is a 2 edge colouring of F in which each monochromatic subgraph has chromatic number n-1. for any n-chromatic G. Could be much larger

36. The conjecture is true for n=3,4 (Burr-Erdos-Lovasz, 1976) The conjecture is true for n=5 (Zhu, 1992) The conjecture is true (Zhu, 2011) Attempts by Tardif, West, etc. on non-diagonal cases of chromatic Ramsey numbers of graphs. There are some upper bounds on No more other case of the conjecture were verified, until 2011

37. For any 2 edge-colouring of Kn, there is a monochromatic graph which is a homomorphic image of G.

38. Graph homomorphism = edge preserving map G H

39. To prove Burr-Erdos-Lovasz conjecture for n, we need to construct an n-chromatic graph G, so that any 2 edge colouring of has a monochromatic subgraph which is a homomorphic image of G. The construction of G is easy: Take all 2 edge colourings of For each 2 edge colouring ci of, one of the monochromatic subgraph, say Gi,, has chromatic number at least n.

40. To prove this conjecture for n, we need to construct an n-chromatic graph G, so that any 2 edge colouring of has a monochromatic subgraph which is a homomorphic image of G. The construction of G is easy: Take all 2 edge colourings of For each 2 edge colouring of, one of the monochromatic subgraph, say Gi,, has chromatic number at least n.

41. G H GxH Projections are homomorphisms

42. To prove this conjecture for n, we need to construct an n-chromatic graph G, so that any 2 edge colouring of has a monochromatic subgraph which is a homomorphic image of G. The construction of G is easy: Take all 2 edge colourings of For each 2 edge colouring ci of, one of the monochromatic subgraph, say Gi,, has chromatic number at least n. ?

43. G H

45. To prove this conjecture for n, we need to construct an n-chromatic graph G, so that any 2 edge colouring of has a monochromatic subgraph which is a homomorphic image of G. ? If Hedetniemi’s conjecture is true, then Burr-Erdos-Lovasz conjecture is true.

46. A k-colouring of G partition V(G) into k independent sets. integer linear programming

47. A k-colouring of G partition V(G) into k independent sets. linear programming

48. Fractional Hedetniemi’s conjecture

49. To prove this conjecture for n, we need to construct an n-chromatic graph G, so that any 2 edge colouring of has a monochromatic subgraph which is a homomorphic image of G. If Hedetniemi’s conjecture is true, then Burr-Erdos-Lovasz conjecture is true. Observation: If fractional Hedetniemi’s conjecture is true, then Burr-Erdos-Lovasz conjecture is true.

50. To prove this conjecture for n, we need to construct an n-chromatic graph G, so that any 2 edge colouring of has a monochromatic subgraph which is a homomorphic image of G. The construction of G is easy: Take all 2 edge colourings of For each 2 edge colouring ci of, one of the monochromatic subgraph, say Gi,, has chromatic number at least n. fractional chromatic number > n-1

51. Fractional Hedetniemi’s conjecture Theorem [Huajun Zhang, 2011] If both G and H are vertex transitive, then Theorem [Z, 2011]

52. A k-colouring of G partition V(G) into k independent sets. linear programming dual problem

53. The fractional chromatic number of G is obtained by solving a linear programming problem The fractional clique number of G is obtained by solving its dual problem

54. Fractional Hedetniemi’s conjecture is true Theorem [Z, 2010] Easy! Difficult!

55. Easy Difficult

56. Easy! Difficult!

57. What is the relation between and ?

58. Basic relation between and is a refinement of is an approximation of

59. There are many periodical scheduling problems in computer sciences. The reciprocal of is studied by computer scientists as efficiency of a certain scheduling method, in 1986. Circular colouring is a good model for periodical scheduling problems

60. Theorem [Zhu, 2011] No conjecture yet!

61. Using fractional version of Hedetniemi’s conjecture, Jao-Tardif-West-Zhu proved in 2014

63. min ? No ! [ Jao-Tardif-West-Zhu, 2014]

64. Some other results by Jao-Tardif-West-Zhu, 2014

65. 謝謝