Nordhaus-Gaddum inequalities for coloring games Cl ement - - PowerPoint PPT Presentation

nordhaus gaddum inequalities for coloring games
SMART_READER_LITE
LIVE PREVIEW

Nordhaus-Gaddum inequalities for coloring games Cl ement - - PowerPoint PPT Presentation

Nordhaus-Gaddum inequalities for coloring games Cl ement Charpentier Joint work with Simone Dantas (Universidad Federal Fluminense), Celina M. H. de Figueiredo (Universidad Federal do Rio de Janeiro), Ana Furtado (Universidad Federal do Rio


slide-1
SLIDE 1

Nordhaus-Gaddum inequalities for coloring games

Cl´ ement Charpentier

Joint work with Simone Dantas (Universidad Federal Fluminense), Celina M. H. de Figueiredo (Universidad Federal do Rio de Janeiro), Ana Furtado (Universidad Federal do Rio de Janeiro), Sylvain Gravier (Universit´ e Grenoble Alpes)

GAG Workshop (Lyon, Oct. 2017)

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 1 / 38

slide-2
SLIDE 2

Definitions

Definitions

Proper coloring

A coloring of a graph is the assignment of a color to each vertex of the

  • graph. A coloring is proper if two adjacent vertices have different colors.

The chromatic number of a graph G is denoted by χ(G).

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 2 / 38

slide-3
SLIDE 3

Definitions

Definitions

Coloring game

The coloring game was introduced by Brahms in 1981 and rediscovered in 1991 by Bodlaender. At start : a graph G uncolored and a set Φ of colors. Alice and Bob take turns coloring an uncolored vertex of G with a color of Φ. Alice wins when the graph is fully colored. Bob wins if he can prevent Alice’s victory.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 3 / 38

slide-4
SLIDE 4

Definitions

Definitions

Coloring game

The coloring game was introduced by Brahms in 1981 and rediscovered in 1991 by Bodlaender. At start : a graph G uncolored and a set Φ of colors. Alice and Bob take turns coloring an uncolored vertex of G with a color of Φ. Alice wins when the graph is fully colored. Bob wins if he can prevent Alice’s victory.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 3 / 38

slide-5
SLIDE 5

Definitions

Definitions

Coloring game

The coloring game was introduced by Brahms in 1981 and rediscovered in 1991 by Bodlaender. At start : a graph G uncolored and a set Φ of colors. Alice and Bob take turns coloring an uncolored vertex of G with a color of Φ. Alice wins when the graph is fully colored. Bob wins if he can prevent Alice’s victory.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 3 / 38

slide-6
SLIDE 6

Definitions

Definitions

Coloring game

The coloring game was introduced by Brahms in 1981 and rediscovered in 1991 by Bodlaender. At start : a graph G uncolored and a set Φ of colors. Alice and Bob take turns coloring an uncolored vertex of G with a color of Φ. Alice wins when the graph is fully colored. Bob wins if he can prevent Alice’s victory.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 3 / 38

slide-7
SLIDE 7

Definitions

Example

Coloring game

A little game...

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 4 / 38

slide-8
SLIDE 8

Definitions

Example

Coloring game

A little game...

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 5 / 38

slide-9
SLIDE 9

Definitions

Example

Coloring game

A little game...

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 6 / 38

slide-10
SLIDE 10

Definitions

Example

Coloring game

A little game...

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 7 / 38

slide-11
SLIDE 11

Definitions

Example

Coloring game

A little game...

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 8 / 38

slide-12
SLIDE 12

Definitions

Example

Coloring game

A little game...

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 9 / 38

slide-13
SLIDE 13

Definitions

Example

Coloring game

A little game...

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 10 / 38

slide-14
SLIDE 14

Definitions

Monotony by subset ?

Question If Alice has a winning strategy for k colors on a graph G, does she have a winning strategy for k colors on any subgraph of G ?

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 11 / 38

slide-15
SLIDE 15

Definitions

Coloring game

Another game ?

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 12 / 38

slide-16
SLIDE 16

Definitions

Coloring game

Another game ?

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 13 / 38

slide-17
SLIDE 17

Definitions

Coloring game

Another game ?

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 14 / 38

slide-18
SLIDE 18

Definitions

Coloring game

Another game ?

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 15 / 38

slide-19
SLIDE 19

Definitions

Coloring game

Another game ?

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 16 / 38

slide-20
SLIDE 20

Definitions

Coloring game

Another game ?

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 17 / 38

slide-21
SLIDE 21

Definitions

Coloring game

Another game ?

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 18 / 38

slide-22
SLIDE 22

Definitions

Coloring game

Another game ?

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 19 / 38

slide-23
SLIDE 23

Definitions

Coloring game

Another game ?

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 20 / 38

slide-24
SLIDE 24

Definitions

Monotony by number of colors ?

An open problem

Let G be a graph on which Alice has a winning strategy with k colors. Let k′ > k. Does Alice have a winning strategy for G with k′ colors ?

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 21 / 38

slide-25
SLIDE 25

Definitions

Monotony by number of colors ?

An open problem

Let G be a graph on which Alice has a winning strategy with k colors. Let k′ > k. Does Alice have a winning strategy for G with k′ colors ?

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 21 / 38

slide-26
SLIDE 26

Definitions

Monotony by number of colors ?

An open problem

Let G be a graph on which Alice has a winning strategy with k colors. Let k′ > k. Does Alice have a winning strategy for G with k′ colors ?

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 21 / 38

slide-27
SLIDE 27

Definitions

Monotony by number of colors ?

An open problem

Let G be a graph on which Alice has a winning strategy with k colors. Let k′ > k. Does Alice have a winning strategy for G with k′ colors ?

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 21 / 38

slide-28
SLIDE 28

Definitions

Game chromatic number

Coloring game

The game chromatic number of a graph G is the smaller number of colors for which Alice has a winning strategy for G. Trivial bounds For any graph G, χ(G) ≤ χg(G) ≤ ∆(G) + 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 22 / 38

slide-29
SLIDE 29

Definitions

Game chromatic number

Coloring game

The game chromatic number of a graph G is the smaller number of colors for which Alice has a winning strategy for G. Trivial bounds For any graph G, χ(G) ≤ χg(G) ≤ ∆(G) + 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 22 / 38

slide-30
SLIDE 30

Definitions

Norhaus-Gaddum inequalities

Theorem [Nordhaus and Gaddum, 1956] For any graph G of order n, 2√n ≤ χ(G) + χ(G) ≤ n + 1. Survey: [Aouiche and Hansen, 2013].

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 23 / 38

slide-31
SLIDE 31

Definitions

Norhaus-Gaddum inequalities

Result (1)

Theorem [Nordhaus and Gaddum, 1956] For any graph G of order n, 2√n ≤ χ(G) + χ(G) ≤ n + 1. These bounds are tight for an infinite number of values of n. Theorem For any graph G of order n, 2√n ≤ χg(G) + χg(G) ≤ 3n

2

  • .

These bounds are asymptotically tight. For infinite values of n, there are graphs G such that χg(G) + χg(G) = 2 √ 2n − 1 and χg(G) + χg(G) = 4n

3

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 24 / 38

slide-32
SLIDE 32

Definitions

Norhaus-Gaddum inequalities

Result (1)

Theorem [Nordhaus and Gaddum, 1956] For any graph G of order n, 2√n ≤ χ(G) + χ(G) ≤ n + 1. These bounds are tight for an infinite number of values of n. Theorem For any graph G of order n, 2√n ≤ χg(G) + χg(G) ≤ 3n

2

  • .

These bounds are asymptotically tight. For infinite values of n, there are graphs G such that χg(G) + χg(G) = 2 √ 2n − 1 and χg(G) + χg(G) = 4n

3

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 24 / 38

slide-33
SLIDE 33

Definitions

Norhaus-Gaddum inequalities

Result (1)

Theorem [Nordhaus and Gaddum, 1956] For any graph G of order n, 2√n ≤ χ(G) + χ(G) ≤ n + 1. These bounds are tight for an infinite number of values of n. Theorem For any graph G of order n, 2√n ≤ χg(G) + χg(G) ≤ 3n

2

  • .

These bounds are asymptotically tight. For infinite values of n, there are graphs G such that χg(G) + χg(G) = 2 √ 2n − 1 and χg(G) + χg(G) = 4n

3

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 24 / 38

slide-34
SLIDE 34

Definitions

Norhaus-Gaddum inequalities

Result (1)

Theorem [Nordhaus and Gaddum, 1956] For any graph G of order n, 2√n ≤ χ(G) + χ(G) ≤ n + 1. These bounds are tight for an infinite number of values of n. Theorem For any graph G of order n, 2√n ≤ χg(G) + χg(G) ≤ 3n

2

  • .

These bounds are asymptotically tight. For infinite values of n, there are graphs G such that χg(G) + χg(G) = 2 √ 2n − 1 and χg(G) + χg(G) = 4n

3

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 24 / 38

slide-35
SLIDE 35

Definitions

Norhaus-Gaddum inequalities

Result (1)

Theorem [Nordhaus and Gaddum, 1956] For any graph G of order n, 2√n ≤ χ(G) + χ(G) ≤ n + 1. These bounds are tight for an infinite number of values of n. Theorem For any graph G of order n, 2√n ≤ χg(G) + χg(G) ≤ 3n

2

  • .

These bounds are asymptotically tight. For infinite values of n, there are graphs G such that χg(G) + χg(G) = 2 √ 2n − 1 and χg(G) + χg(G) = 4n

3

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 24 / 38

slide-36
SLIDE 36

Definitions

Norhaus-Gaddum inequalities

Result (1)

Theorem [Nordhaus and Gaddum, 1956] For any graph G of order n, 2√n ≤ χ(G) + χ(G) ≤ n + 1. These bounds are tight for an infinite number of values of n. Theorem For any graph G of order n, 2√n ≤ χg(G) + χg(G) ≤ 3n

2

  • .

These bounds are asymptotically tight. For infinite values of n, there are graphs G such that χg(G) + χg(G) = 2 √ 2n − 1 and χg(G) + χg(G) = 4n

3

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 24 / 38

slide-37
SLIDE 37

Definitions

Lower bound

Lower bound For any graph G of order n, 2√n ≤ χ(G) + χ(G) ≤ χg(G) + χg(G). This lemma is tight for G = P1. Consider G is a complete √n

  • partite graph.

χ(G) + χ(G) = 2√n Consider G is a complete n

2

  • partite graph.

χg(G) + χg(G) = 2 √ 2n − 1

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 25 / 38

slide-38
SLIDE 38

Definitions

Lower bound

Lower bound For any graph G of order n, 2√n ≤ χ(G) + χ(G) ≤ χg(G) + χg(G). This lemma is tight for G = P1. Consider G is a complete √n

  • partite graph.

χ(G) + χ(G) = 2√n Consider G is a complete n

2

  • partite graph.

χg(G) + χg(G) = 2 √ 2n − 1

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 25 / 38

slide-39
SLIDE 39

Definitions

Lower bound

Lower bound For any graph G of order n, 2√n ≤ χ(G) + χ(G) ≤ χg(G) + χg(G). This lemma is tight for G = P1. Consider G is a complete √n

  • partite graph.

χ(G) + χ(G) = 2√n Consider G is a complete n

2

  • partite graph.

χg(G) + χg(G) = 2 √ 2n − 1

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 25 / 38

slide-40
SLIDE 40

Definitions

Lower bound

Lower bound For any graph G of order n, 2√n ≤ χ(G) + χ(G) ≤ χg(G) + χg(G). This lemma is tight for G = P1. Consider G is a complete √n

  • partite graph.

χ(G) + χ(G) = 2√n Consider G is a complete n

2

  • partite graph.

χg(G) + χg(G) = 2 √ 2n − 1

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 25 / 38

slide-41
SLIDE 41

Definitions

Lower bound

Lower bound For any graph G of order n, 2√n ≤ χ(G) + χ(G) ≤ χg(G) + χg(G). This lemma is tight for G = P1. Consider G is a complete √n

  • partite graph.

χ(G) + χ(G) = 2√n Consider G is a complete n

2

  • partite graph.

χg(G) + χg(G) = 2 √ 2n − 1

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 25 / 38

slide-42
SLIDE 42

Definitions

Lower bound

Lower bound For any graph G of order n, 2√n ≤ χ(G) + χ(G) ≤ χg(G) + χg(G). This lemma is tight for G = P1. Consider G is a complete √n

  • partite graph.

χ(G) + χ(G) = 2√n Consider G is a complete n

2

  • partite graph.

χg(G) + χg(G) = 2 √ 2n − 1

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 25 / 38

slide-43
SLIDE 43

Definitions

Lower bound

Lower bound For any graph G of order n, 2√n ≤ χ(G) + χ(G) ≤ χg(G) + χg(G). This lemma is tight for G = P1. Consider G is a complete √n

  • partite graph.

χ(G) + χ(G) = 2√n Consider G is a complete n

2

  • partite graph.

χg(G) + χg(G) = 2 √ 2n − 1

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 25 / 38

slide-44
SLIDE 44

Definitions

Upper bound

Upper bound For any graph G of order n, χg(G) + χg(G) ≤ 3n

2

  • .

Proof : Assume n is even. Alice colors with priority vertices with degree at least n

2.

Let A(G) be the set of vertices of degree larger than n

2,

B(G) = V (G) − A(G). A(G) = B(G) and B(G) = A(G). If |B(G)| < n

4

  • , then χg(G) ≤ n

2.

If |B(G)| ≥ n

4

  • , then χg(G) ≤ n

2 + |B(G)| −

n

4

  • .

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 26 / 38

slide-45
SLIDE 45

Definitions

Upper bound

Upper bound For any graph G of order n, χg(G) + χg(G) ≤ 3n

2

  • .

Proof : Assume n is even. Alice colors with priority vertices with degree at least n

2.

Let A(G) be the set of vertices of degree larger than n

2,

B(G) = V (G) − A(G). A(G) = B(G) and B(G) = A(G). If |B(G)| < n

4

  • , then χg(G) ≤ n

2.

If |B(G)| ≥ n

4

  • , then χg(G) ≤ n

2 + |B(G)| −

n

4

  • .

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 26 / 38

slide-46
SLIDE 46

Definitions

Upper bound

Upper bound For any graph G of order n, χg(G) + χg(G) ≤ 3n

2

  • .

Proof : Assume n is even. Alice colors with priority vertices with degree at least n

2.

Let A(G) be the set of vertices of degree larger than n

2,

B(G) = V (G) − A(G). A(G) = B(G) and B(G) = A(G). If |B(G)| < n

4

  • , then χg(G) ≤ n

2.

If |B(G)| ≥ n

4

  • , then χg(G) ≤ n

2 + |B(G)| −

n

4

  • .

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 26 / 38

slide-47
SLIDE 47

Definitions

Upper bound

Upper bound For any graph G of order n, χg(G) + χg(G) ≤ 3n

2

  • .

Proof : Assume n is even. Alice colors with priority vertices with degree at least n

2.

Let A(G) be the set of vertices of degree larger than n

2,

B(G) = V (G) − A(G). A(G) = B(G) and B(G) = A(G). If |B(G)| < n

4

  • , then χg(G) ≤ n

2.

If |B(G)| ≥ n

4

  • , then χg(G) ≤ n

2 + |B(G)| −

n

4

  • .

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 26 / 38

slide-48
SLIDE 48

Definitions

Upper bound

Upper bound For any graph G of order n, χg(G) + χg(G) ≤ 3n

2

  • .

Proof : Assume n is even. Alice colors with priority vertices with degree at least n

2.

Let A(G) be the set of vertices of degree larger than n

2,

B(G) = V (G) − A(G). A(G) = B(G) and B(G) = A(G). If |B(G)| < n

4

  • , then χg(G) ≤ n

2.

If |B(G)| ≥ n

4

  • , then χg(G) ≤ n

2 + |B(G)| −

n

4

  • .

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 26 / 38

slide-49
SLIDE 49

Definitions

Upper bound

Upper bound For any graph G of order n, χg(G) + χg(G) ≤ 3n

2

  • .

Proof : Assume n is even. Alice colors with priority vertices with degree at least n

2.

Let A(G) be the set of vertices of degree larger than n

2,

B(G) = V (G) − A(G). A(G) = B(G) and B(G) = A(G). If |B(G)| < n

4

  • , then χg(G) ≤ n

2.

If |B(G)| ≥ n

4

  • , then χg(G) ≤ n

2 + |B(G)| −

n

4

  • .

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 26 / 38

slide-50
SLIDE 50

Definitions

Upper bound

Upper bound For any graph G of order n, χg(G) + χg(G) ≤ 3n

2

  • .

This lemma is tight for G = P1 and G = P4. Consider the joint graph Gl = Sl + K⌈ l

2⌉, n = l +

l

2

  • χg(Gl) = 2

l

2

  • − 1

χg(Gl) = l If n ≥ 5 and n = 1mod3, then χg(Gl) + χg(Gl) = 4n

3

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 27 / 38

slide-51
SLIDE 51

Definitions

Upper bound

Upper bound For any graph G of order n, χg(G) + χg(G) ≤ 3n

2

  • .

This lemma is tight for G = P1 and G = P4. Consider the joint graph Gl = Sl + K⌈ l

2⌉, n = l +

l

2

  • χg(Gl) = 2

l

2

  • − 1

χg(Gl) = l If n ≥ 5 and n = 1mod3, then χg(Gl) + χg(Gl) = 4n

3

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 27 / 38

slide-52
SLIDE 52

Definitions

Upper bound

Upper bound For any graph G of order n, χg(G) + χg(G) ≤ 3n

2

  • .

This lemma is tight for G = P1 and G = P4. Consider the joint graph Gl = Sl + K⌈ l

2⌉, n = l +

l

2

  • χg(Gl) = 2

l

2

  • − 1

χg(Gl) = l If n ≥ 5 and n = 1mod3, then χg(Gl) + χg(Gl) = 4n

3

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 27 / 38

slide-53
SLIDE 53

Definitions

Upper bound

Upper bound For any graph G of order n, χg(G) + χg(G) ≤ 3n

2

  • .

This lemma is tight for G = P1 and G = P4. Consider the joint graph Gl = Sl + K⌈ l

2⌉, n = l +

l

2

  • χg(Gl) = 2

l

2

  • − 1

χg(Gl) = l If n ≥ 5 and n = 1mod3, then χg(Gl) + χg(Gl) = 4n

3

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 27 / 38

slide-54
SLIDE 54

Definitions

Upper bound

Upper bound For any graph G of order n, χg(G) + χg(G) ≤ 3n

2

  • .

This lemma is tight for G = P1 and G = P4. Consider the joint graph Gl = Sl + K⌈ l

2⌉, n = l +

l

2

  • χg(Gl) = 2

l

2

  • − 1

χg(Gl) = l If n ≥ 5 and n = 1mod3, then χg(Gl) + χg(Gl) = 4n

3

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 27 / 38

slide-55
SLIDE 55

Definitions

Upper bound

Upper bound For any graph G of order n, χg(G) + χg(G) ≤ 3n

2

  • .

This lemma is tight for G = P1 and G = P4. Consider the joint graph Gl = Sl + K⌈ l

2⌉, n = l +

l

2

  • χg(Gl) = 2

l

2

  • − 1

χg(Gl) = l If n ≥ 5 and n = 1mod3, then χg(Gl) + χg(Gl) = 4n

3

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 27 / 38

slide-56
SLIDE 56

Definitions

Norhaus-Gaddum inequalities

Result (1)

Theorem [Nordhaus and Gaddum, 1956] For any graph G of order n, 2√n ≤ χ(G) + χ(G) ≤ n + 1. These bounds are tight for an infinite number of values of n. Theorem For any graph G of order n, 2√n ≤ χg(G) + χg(G) ≤ 3n

2

  • .

These bounds are asymptotically tight. For infinite values of n, there are graphs G such that χg(G) + χg(G) = 2 √ 2n − 1 and χg(G) + χg(G) = 4n

3

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 28 / 38

slide-57
SLIDE 57

Definitions

Marking game

Or ”colorblind coloring game”

Marking game [Zhu, 1999] G is a graph, k an integer. Alice and Bob take turns marking an unmarked vertex of G. At each turn, the marked vertex must have no more than k − 1 marked neighbors. Alice wins when all the vertices are marked, Bob wins otherwise. The smaller k for which Alice has a winning strategy on G is the coloring game number, denoted by colg(G). For any graph G, χg(G) ≤ colg(G).

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 29 / 38

slide-58
SLIDE 58

Definitions

Marking game

Or ”colorblind coloring game”

Marking game [Zhu, 1999] G is a graph, k an integer. Alice and Bob take turns marking an unmarked vertex of G. At each turn, the marked vertex must have no more than k − 1 marked neighbors. Alice wins when all the vertices are marked, Bob wins otherwise. The smaller k for which Alice has a winning strategy on G is the coloring game number, denoted by colg(G). For any graph G, χg(G) ≤ colg(G).

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 29 / 38

slide-59
SLIDE 59

Definitions

Marking game

Or ”colorblind coloring game”

Marking game [Zhu, 1999] G is a graph, k an integer. Alice and Bob take turns marking an unmarked vertex of G. At each turn, the marked vertex must have no more than k − 1 marked neighbors. Alice wins when all the vertices are marked, Bob wins otherwise. The smaller k for which Alice has a winning strategy on G is the coloring game number, denoted by colg(G). For any graph G, χg(G) ≤ colg(G).

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 29 / 38

slide-60
SLIDE 60

Definitions

Marking game

Or ”colorblind coloring game”

Marking game [Zhu, 1999] G is a graph, k an integer. Alice and Bob take turns marking an unmarked vertex of G. At each turn, the marked vertex must have no more than k − 1 marked neighbors. Alice wins when all the vertices are marked, Bob wins otherwise. The smaller k for which Alice has a winning strategy on G is the coloring game number, denoted by colg(G). For any graph G, χg(G) ≤ colg(G).

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 29 / 38

slide-61
SLIDE 61

Definitions

Marking game

Or ”colorblind coloring game”

Marking game [Zhu, 1999] G is a graph, k an integer. Alice and Bob take turns marking an unmarked vertex of G. At each turn, the marked vertex must have no more than k − 1 marked neighbors. Alice wins when all the vertices are marked, Bob wins otherwise. The smaller k for which Alice has a winning strategy on G is the coloring game number, denoted by colg(G). For any graph G, χg(G) ≤ colg(G).

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 29 / 38

slide-62
SLIDE 62

Definitions

Marking game

Or ”colorblind coloring game”

Marking game [Zhu, 1999] G is a graph, k an integer. Alice and Bob take turns marking an unmarked vertex of G. At each turn, the marked vertex must have no more than k − 1 marked neighbors. Alice wins when all the vertices are marked, Bob wins otherwise. The smaller k for which Alice has a winning strategy on G is the coloring game number, denoted by colg(G). For any graph G, χg(G) ≤ colg(G).

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 29 / 38

slide-63
SLIDE 63

Definitions

Marking game

A much easier game to study...

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 30 / 38

slide-64
SLIDE 64

Definitions

Norhaus-Gaddum inequalities

Result (2)

Theorem For any graph G of order n, 2√n ≤ χg(G) + χg(G) ≤ 3n

2

  • .

For infinite values of n, there are graphs G such that χg(G) + χg(G) = 2 √ 2n − 1 and χg(G) + χg(G) = 4n

3

  • − 1.

Theorem For any graph G of order n, 2 n

2

  • ≤ colg(G) + colg(G) ≤

8n−2

5

  • .

The lower bound is tight for infinitely many values of n. The upper bound is asymptotically tight, and for an infinite number of values of n, there is a graph G of order n with colg(G) + colg(G) = 3n

2

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 31 / 38

slide-65
SLIDE 65

Definitions

Norhaus-Gaddum inequalities

Result (2)

Theorem For any graph G of order n, 2√n ≤ χg(G) + χg(G) ≤ 3n

2

  • .

For infinite values of n, there are graphs G such that χg(G) + χg(G) = 2 √ 2n − 1 and χg(G) + χg(G) = 4n

3

  • − 1.

Theorem For any graph G of order n, 2 n

2

  • ≤ colg(G) + colg(G) ≤

8n−2

5

  • .

The lower bound is tight for infinitely many values of n. The upper bound is asymptotically tight, and for an infinite number of values of n, there is a graph G of order n with colg(G) + colg(G) = 3n

2

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 31 / 38

slide-66
SLIDE 66

Definitions

Norhaus-Gaddum inequalities

Result (2)

Theorem For any graph G of order n, 2√n ≤ χg(G) + χg(G) ≤ 3n

2

  • .

For infinite values of n, there are graphs G such that χg(G) + χg(G) = 2 √ 2n − 1 and χg(G) + χg(G) = 4n

3

  • − 1.

Theorem For any graph G of order n, 2 n

2

  • ≤ colg(G) + colg(G) ≤

8n−2

5

  • .

The lower bound is tight for infinitely many values of n. The upper bound is asymptotically tight, and for an infinite number of values of n, there is a graph G of order n with colg(G) + colg(G) = 3n

2

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 31 / 38

slide-67
SLIDE 67

Definitions

Norhaus-Gaddum inequalities

Result (2)

Theorem For any graph G of order n, 2√n ≤ χg(G) + χg(G) ≤ 3n

2

  • .

For infinite values of n, there are graphs G such that χg(G) + χg(G) = 2 √ 2n − 1 and χg(G) + χg(G) = 4n

3

  • − 1.

Theorem For any graph G of order n, 2 n

2

  • ≤ colg(G) + colg(G) ≤

8n−2

5

  • .

The lower bound is tight for infinitely many values of n. The upper bound is asymptotically tight, and for an infinite number of values of n, there is a graph G of order n with colg(G) + colg(G) = 3n

2

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 31 / 38

slide-68
SLIDE 68

Definitions

Lower bound

Lemma For any graph G of order n, 2 n

2

  • ≤ colg(G) + colg(G).

If n is even, colg(G) + colg(G) ≤ n. If n is odd, colg(G) + colg(G) ≤ n + 1. Consider the case n is odd. Proof (sketch) : Order the vertices by increasing degree. Bob always selects the unselected vertex with largest degree.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 32 / 38

slide-69
SLIDE 69

Definitions

Lower bound

Lemma For any graph G of order n, 2 n

2

  • ≤ colg(G) + colg(G).

If n is even, colg(G) + colg(G) ≤ n. If n is odd, colg(G) + colg(G) ≤ n + 1. Consider the case n is odd. Proof (sketch) : Order the vertices by increasing degree. Bob always selects the unselected vertex with largest degree.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 32 / 38

slide-70
SLIDE 70

Definitions

Lower bound

Lemma For any graph G of order n, 2 n

2

  • ≤ colg(G) + colg(G).

If n is even, colg(G) + colg(G) ≤ n. If n is odd, colg(G) + colg(G) ≤ n + 1. Consider the case n is odd. Proof (sketch) : Order the vertices by increasing degree. Bob always selects the unselected vertex with largest degree.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 32 / 38

slide-71
SLIDE 71

Definitions

Lower bound

Lemma For any graph G of order n, 2 n

2

  • ≤ colg(G) + colg(G).

If n is even, colg(G) + colg(G) ≤ n. If n is odd, colg(G) + colg(G) ≤ n + 1. Consider the case n is odd. Proof (sketch) : Order the vertices by increasing degree. Bob always selects the unselected vertex with largest degree.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 32 / 38

slide-72
SLIDE 72

Definitions

Lower bound

Lemma For any graph G of order n, 2 n

2

  • ≤ colg(G) + colg(G).

If n is even, colg(G) + colg(G) ≤ n. If n is odd, colg(G) + colg(G) ≤ n + 1. Consider the case n is odd. Proof (sketch) : Order the vertices by increasing degree. Bob always selects the unselected vertex with largest degree.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 32 / 38

slide-73
SLIDE 73

Definitions

Lower bound

Tightness

If n is even, colg(G) + colg(G) ≤ n. If n is odd, colg(G) + colg(G) ≤ n + 1. When n is odd, this bound is reached by Kn. When n is even, this bound is reached for every n = 2, 4.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 33 / 38

slide-74
SLIDE 74

Definitions

Lower bound

Tightness

If n is even, colg(G) + colg(G) ≤ n. If n is odd, colg(G) + colg(G) ≤ n + 1. When n is odd, this bound is reached by Kn. When n is even, this bound is reached for every n = 2, 4.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 33 / 38

slide-75
SLIDE 75

Definitions

Lower bound

Tightness

If n is even, colg(G) + colg(G) ≤ n. If n is odd, colg(G) + colg(G) ≤ n + 1. When n is odd, this bound is reached by Kn. When n is even, this bound is reached for every n = 2, 4.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 33 / 38

slide-76
SLIDE 76

Definitions

Lower bound

Tightness

If n is even, colg(G) + colg(G) ≤ n. If n is odd, colg(G) + colg(G) ≤ n + 1. When n is odd, this bound is reached by Kn. When n is even, this bound is reached for every n = 2, 4.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 33 / 38

slide-77
SLIDE 77

Definitions

Lower bound

Tightness

If n is even, colg(G) + colg(G) ≤ n. If n is odd, colg(G) + colg(G) ≤ n + 1. When n is odd, this bound is reached by Kn. When n is even, this bound is reached for every n = 2, 4.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 33 / 38

slide-78
SLIDE 78

Definitions

Upper bound

Lemma For any graph G of order n, colg(G) + colg(G) ≤ 8n−2

5

  • .

Proof (sketch) : Alice always selects the unselected vertex with largest

  • degree. Observe the vertex selected after colg(G) − 1 of its neighbors.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 34 / 38

slide-79
SLIDE 79

Definitions

Upper bound

Lemma For any graph G of order n, colg(G) + colg(G) ≤ 8n−2

5

  • .

Proof (sketch) : Alice always selects the unselected vertex with largest

  • degree. Observe the vertex selected after colg(G) − 1 of its neighbors.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 34 / 38

slide-80
SLIDE 80

Definitions

Upper bound

Lemma For any graph G of order n, colg(G) + colg(G) ≤ 8n−2

5

  • .

Proof (sketch) : Alice always selects the unselected vertex with largest

  • degree. Observe the vertex selected after colg(G) − 1 of its neighbors.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 34 / 38

slide-81
SLIDE 81

Definitions

Upper bound

Upper bound For any graph G of order n, colg(G) + colg(G) ≤ 8n−2

5

  • .

This lemma is tight for G = P4. Consider the joint graphs Gl = Sl + Kl+1 and Gl′ = Sl + Kl+2. colg(Gl) = 2l + 1, colg(Gl′) = 2l + 2 colg(Gl) = colg(Gl′) = l colg(Gl) + colg(Gl) = 3n

2

  • − 1, and colg(Gl′) + colg(Gl′) = 3n

2 − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 35 / 38

slide-82
SLIDE 82

Definitions

Upper bound

Upper bound For any graph G of order n, colg(G) + colg(G) ≤ 8n−2

5

  • .

This lemma is tight for G = P4. Consider the joint graphs Gl = Sl + Kl+1 and Gl′ = Sl + Kl+2. colg(Gl) = 2l + 1, colg(Gl′) = 2l + 2 colg(Gl) = colg(Gl′) = l colg(Gl) + colg(Gl) = 3n

2

  • − 1, and colg(Gl′) + colg(Gl′) = 3n

2 − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 35 / 38

slide-83
SLIDE 83

Definitions

Upper bound

Upper bound For any graph G of order n, colg(G) + colg(G) ≤ 8n−2

5

  • .

This lemma is tight for G = P4. Consider the joint graphs Gl = Sl + Kl+1 and Gl′ = Sl + Kl+2. colg(Gl) = 2l + 1, colg(Gl′) = 2l + 2 colg(Gl) = colg(Gl′) = l colg(Gl) + colg(Gl) = 3n

2

  • − 1, and colg(Gl′) + colg(Gl′) = 3n

2 − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 35 / 38

slide-84
SLIDE 84

Definitions

Upper bound

Upper bound For any graph G of order n, colg(G) + colg(G) ≤ 8n−2

5

  • .

This lemma is tight for G = P4. Consider the joint graphs Gl = Sl + Kl+1 and Gl′ = Sl + Kl+2. colg(Gl) = 2l + 1, colg(Gl′) = 2l + 2 colg(Gl) = colg(Gl′) = l colg(Gl) + colg(Gl) = 3n

2

  • − 1, and colg(Gl′) + colg(Gl′) = 3n

2 − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 35 / 38

slide-85
SLIDE 85

Definitions

Upper bound

Upper bound For any graph G of order n, colg(G) + colg(G) ≤ 8n−2

5

  • .

This lemma is tight for G = P4. Consider the joint graphs Gl = Sl + Kl+1 and Gl′ = Sl + Kl+2. colg(Gl) = 2l + 1, colg(Gl′) = 2l + 2 colg(Gl) = colg(Gl′) = l colg(Gl) + colg(Gl) = 3n

2

  • − 1, and colg(Gl′) + colg(Gl′) = 3n

2 − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 35 / 38

slide-86
SLIDE 86

Definitions

Upper bound

Upper bound For any graph G of order n, colg(G) + colg(G) ≤ 8n−2

5

  • .

This lemma is tight for G = P4. Consider the joint graphs Gl = Sl + Kl+1 and Gl′ = Sl + Kl+2. colg(Gl) = 2l + 1, colg(Gl′) = 2l + 2 colg(Gl) = colg(Gl′) = l colg(Gl) + colg(Gl) = 3n

2

  • − 1, and colg(Gl′) + colg(Gl′) = 3n

2 − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 35 / 38

slide-87
SLIDE 87

Definitions

Norhaus-Gaddum inequalities

Result (3)

Theorem For any graph G of order n, 2√n ≤ χg(G) + χg(G) ≤ 3n

2

  • .

For infinite values of n, there are graphs G such that χg(G) + χg(G) = 2 √ 2n − 1 and χg(G) + χg(G) = 4n

3

  • − 1.

Theorem For any graph G of order n, 2 n

2

  • ≤ colg(G) + colg(G) ≤

8n−2

5

  • .

The lower bound is tight for infinite values of n. The upper bound is asymptotically tight, and for an infinite number of values of n, there is a graph G of order n with colg(G) + colg(G) = 3n

2

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 36 / 38

slide-88
SLIDE 88

Definitions

Norhaus-Gaddum inequalities

Result (3)

Theorem For any graph G of order n, 2√n ≤ χg(G) + χg(G) ≤ 3n

2

  • .

For infinite values of n, there are graphs G such that χg(G) + χg(G) = 2 √ 2n − 1 and χg(G) + χg(G) = 4n

3

  • − 1.

Theorem For any graph G of order n, 2 n

2

  • ≤ colg(G) + colg(G) ≤

8n−2

5

  • .

The lower bound is tight for infinite values of n. The upper bound is asymptotically tight, and for an infinite number of values of n, there is a graph G of order n with colg(G) + colg(G) = 3n

2

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 36 / 38

slide-89
SLIDE 89

Definitions

Norhaus-Gaddum inequalities

Result (3)

Theorem For any graph G of order n, 2√n ≤ χg(G) + χg(G) ≤ 3n

2

  • .

For infinite values of n, there are graphs G such that χg(G) + χg(G) = 2 √ 2n − 1 and χg(G) + χg(G) = 4n

3

  • − 1.

Theorem For any graph G of order n, 2 n

2

  • ≤ colg(G) + colg(G) ≤

8n−2

5

  • .

The lower bound is tight for infinite values of n. The upper bound is asymptotically tight, and for an infinite number of values of n, there is a graph G of order n with colg(G) + colg(G) = 3n

2

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 36 / 38

slide-90
SLIDE 90

Definitions

Norhaus-Gaddum inequalities

Result (3)

Theorem For any graph G of order n, 2√n ≤ χg(G) + χg(G) ≤ 3n

2

  • .

For infinite values of n, there are graphs G such that χg(G) + χg(G) = 2 √ 2n − 1 and χg(G) + χg(G) = 4n

3

  • − 1.

Theorem For any graph G of order n, 2 n

2

  • ≤ colg(G) + colg(G) ≤

8n−2

5

  • .

The lower bound is tight for infinite values of n. The upper bound is asymptotically tight, and for an infinite number of values of n, there is a graph G of order n with colg(G) + colg(G) = 3n

2

  • − 1.

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 36 / 38

slide-91
SLIDE 91

Definitions

Open problems

”Nothing ends, Adrian. Nothing ever ends.”

Tighten those bounds ? For other coloring and marking games ? For other games on graphs ?

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 37 / 38

slide-92
SLIDE 92

Definitions

Open problems

”Nothing ends, Adrian. Nothing ever ends.”

Tighten those bounds ? For other coloring and marking games ? For other games on graphs ?

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 37 / 38

slide-93
SLIDE 93

Definitions

Open problems

”Nothing ends, Adrian. Nothing ever ends.”

Tighten those bounds ? For other coloring and marking games ? For other games on graphs ?

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 37 / 38

slide-94
SLIDE 94

Definitions

Merci !

C., Dantas, de Figueiredo, Furtado, Gravier Nordhaus-Gaddum inequalities GAG Workshop 38 / 38