Maximum Order of a Planar Oclique is 15

Sagnik Sen
LaBRI, Universit de Bordeaux 1

IWOCA 2012

Kalasalingam University, Tamil Nadu, India 21/07/2012

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Basic denitions
Denition An oriented graph is a directed graph without loops or multiple arcs.

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Basic denitions
Denition An oriented graph is a directed graph without loops or multiple arcs. Denition A simple graph is an undirected graph without loops or multiple edges.

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Basic denitions
Denition An oriented graph is a directed graph without loops or multiple arcs. Denition A simple graph is an undirected graph without loops or multiple edges.

Figure: Oriented graph and its (underlying) simple graph

Sagnik Sen Maximum Order of a Planar Oclique is 15

Classical coloring vs oriented coloring of G

(k -coloring) is a mapping f from the vertex set V (G) to the set {1, 2, ..., k } such that,

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Classical coloring vs oriented coloring of G

(k -coloring) is a mapping f from the vertex set V (G) to the set {1, 2, ..., k } such that, (i) f (u ) = f (v ) whenever u and v are adjacent.

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Classical coloring vs oriented coloring of G

(k -coloring) is a mapping f from the vertex set V (G) to the set {1, 2, ..., k } such that, (i) f (u ) = f (v ) whenever u and v are adjacent.

3 2 1 2 1

Figure: Coloring

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Classical coloring vs oriented coloring of G

(k -coloring) is a mapping f from the vertex set V (G) to the set {1, 2, ..., k } such that, (i) f (u ) = f (v ) whenever u and v are adjacent. (i) f (u ) = f (v ) whenever u and v are adjacent 1 1 2

3 2

Figure: Coloring

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Classical coloring vs oriented coloring of G

(k -coloring) is a mapping f from the vertex set V (G) to the set {1, 2, ..., k } such that, (i) f (u ) = f (v ) whenever u and v are adjacent. (i) f (u ) = f (v ) whenever u and v are adjacent 1 1 2 (ii) if xy and uv are two arcs in G, then f (x ) = f (v ) implies f (y ) = f (u ).

3 2

Figure: Coloring

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Classical coloring vs oriented coloring of G

(k -coloring) is a mapping f from the vertex set V (G) to the set {1, 2, ..., k } such that, (i) f (u ) = f (v ) whenever u and v are adjacent. 3 2 1 2 1 2 1 5
Figure: Coloring

(i) f (u ) = f (v ) whenever u and v are adjacent (ii) if xy and uv are two arcs in G, then f (x ) = f (v ) implies f (y ) = f (u ). 4 3

Figure: Oriented Coloring

Sagnik Sen Maximum Order of a Planar Oclique is 15

Classical coloring vs oriented coloring of G

(k -coloring) is a mapping f from the vertex set V (G) to the set {1, 2, ..., k } such that, (i) f (u ) = f (v ) whenever u and v are adjacent (ii) if xy and uv are two arcs in G, then f (x ) = f (v ) implies f (y ) = f (u ). Oriented chromatic number of a graph G is the minimum k such that G has an oriented k -coloring.

(i) f (u ) = f (v ) whenever u and v are adjacent. Chromatic number of a graph G is the minimum k such that G has a k -coloring.

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Classical coloring vs oriented coloring of G

(k -coloring) is a mapping f from the vertex set V (G) to the set {1, 2, ..., k } such that, (i) f (u ) = f (v ) whenever u and v are adjacent. 3 2 1 2 1 2 1 5
Figure: Coloring

(i) f (u ) = f (v ) whenever u and v are adjacent (ii) if xy and uv are two arcs in G, then f (x ) = f (v ) implies f (y ) = f (u ). 4 3

Figure: Oriented Coloring

Sagnik Sen Maximum Order of a Planar Oclique is 15

Oclique

Denition An oriented clique or oclique is an oriented graph of order (number of vertices) equal to its oriented chromatic number.

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Oclique

Denition An oriented clique or oclique is an oriented graph of order (number of vertices) equal to its oriented chromatic number. alternatively: Denition An oclique is an oriented graph where every pair of distinct non-adjacent vertices are connected by a directed path of length 2.

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Planar Ocliques (Examples)

Figure: Planar Ocliques

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Planar Ocliques (History)

Question: How big (in terms of number of vertices) can a planar oclique be?

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Planar Ocliques (History)

Question: How big (in terms of number of vertices) can a planar oclique be? Theorem (A. Raspaud and E. Sopena (1994)) The oriented chromatic number of a planar graph is at most 80.

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Planar Ocliques (History)

Question: How big (in terms of number of vertices) can a planar oclique be? Theorem (A. Raspaud and E. Sopena (1994)) The oriented chromatic number of a planar graph is at most 80.

Theorem (W. F. Klostermeyer and G. MacGillivray (2004)) The maximum order of a planar oclique is at most 36.

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Planar Ocliques (History)

Question: How big (in terms of number of vertices) can a planar oclique be? Theorem (A. Raspaud and E. Sopena (1994)) The oriented chromatic number of a planar graph is at most 80.

Theorem (W. F. Klostermeyer and G. MacGillivray (2004)) The maximum order of a planar oclique is at most 36.

Conjecture (W. F. Klostermeyer and G. MacGillivray (2004)) The maximum order of a planar oclique is 15.

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Planar Ocliques (Our contribution)

Theorem The maximum order of a planar oclique is 15.

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Proof of the main result

Denition For a graph G, D V (G) dominates G if any vertex of G is either in D or adjacent to a vertex in D. The domination number of a graph G is the minimum cardinality of a dominating set.

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Proof of the main result

Denition For a graph G, D V (G) dominates G if any vertex of G is either in D or adjacent to a vertex in D. The domination number of a graph G is the minimum cardinality of a dominating set.

Theorem (W. Goddard and M. A. Henning (2002)) Every planar graph of diameter 2 has domination number at most 2 except for a particular graph on eleven vertices.

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Proof of the main result

Denition For a graph G, D V (G) dominates G if any vertex of G is either in D or adjacent to a vertex in D. The domination number of a graph G is the minimum cardinality of a dominating set.

Theorem (W. Goddard and M. A. Henning (2002)) Every planar graph of diameter 2 has domination number at most 2 except for a particular graph on eleven vertices.

Lemma An oriented planar graph with domination number 1 has an oriented 15-coloring.
Sagnik Sen Maximum Order of a Planar Oclique is 15

Proof of the main result

Remark: Hence, a planar oclique of order at least 16 has domination number exactly 2.

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Proof of the main result

Remark: Hence, a planar oclique of order at least 16 has domination number exactly 2. Assume G is a counterexample to the theorem, triangulated, with a dominating set D = {x , y }, of order 2, maximal with respect to the number of common neighbours, i.e, |N (x ) N (y )| = C (say).

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Proof of the main result

16 |G| = |D | + |C | + |S |,
+ Sx

(1)
+ Sy

C + C ++

x C +
Sx

Sy

Figure: Structure of G (this is not a planar embedding)

Sagnik Sen Maximum Order of a Planar Oclique is 15

Proof of the main result

How does G look like?

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Proof of the main result

How does G look like? c0 R0 c1 x c2 ci ck 2 ck 1
Figure: Partial drawing of G (this is a planar embedding)

R1 y

Rk 1

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Proof of the main result

How small can |C | be?

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Proof of the main result

How small can |C | be? y1 c0 y y2

x1 x2 x

xnx

yny

Figure: For |C | = 1 while x and y are non-adjacent

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Proof of the main result

How does G look like? c0 R0 c1 x c2 ci ck 2 ck 1
Figure: Partial drawing of G (this is a planar embedding)

R1 y

Rk 1

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Proof of the main result

How small can |C | be? c0 x1 y1 x2 y2 x xnx yny c1 ck 2 ck 1
Figure: At most one non-empty region for 2 |C | 5

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Proof of the main result

How small can |C | be? We show that, |C | 6.

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Proof of the main result

How big can |C | be?

16 |G| = |D | + |C | + |S |,
+ Sx

(2)
+ Sy

C + C ++

x C +
Sx

Sy

Figure: Structure of G (this is not a planar embedding)

Sagnik Sen Maximum Order of a Planar Oclique is 15

Proof of the main result

How big can |C | be? We show that, |C | 5.

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Proof of the main result

Hence we end up proving: 6 |C | 5.

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Proof of the main result

Hence we end up proving: 6 |C | 5.

.......contradiction.

Sagnik Sen

Maximum Order of a Planar Oclique is 15

Thank you

Thank you for your attention.

Sagnik Sen

Maximum Order of a Planar Oclique is 15