# Lucky Choice Number of Planar Graphs with Given Girth

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Lucky Choice Number of Planar Graphs with Given Girth Axel Brandt, Jennifer Diemunsch, Sogol Jahanbekam January 6, 015 Abstract Suppose the vertices of a graph G are labeled with real numbers. For each vertex v G, let S(v) denote the sum of the labels of all vertices adjacent to v. A labeling is called lucky if S(u) S(v) for every pair u and v of adjacent vertices in G. The least integer k for which a graph G has a lucky labeling from {1,,..., k} is called the lucky number of the graph, denoted η(g). In 009, Czerwiński, Grytczuk, and Żelazny [6] conjectured that η(g) χ(g), where χ(g) is the chromatic number of G. In this paper, we improve the current bounds for particular classes of graphs with a strengthening of the results through a list lucky labeling. We apply the discharging method and the Combinatorial Nullstellensatz to show that for a planar graph G of girth at least 6, η(g). This proves the conjecture for non-bipartite planar graphs of girth at least 6. We also show that for girth at least 7, 6, and 5, η(g) is at most 8, 9, and 19, respectively. Keywords: lucky labeling, additive coloring, reducible configuration, discharging method, Combinatorial Nullstellensatz. MSC code: 05C78, 05C15, 05C, 05C78. 1 Introduction In this paper we only consider simple, finite, undirected graphs. For such a graph G, let V (G) denote the vertex set and E(G) the edge set of G. When G is planar, let F (G) be the set of faces of G and l(f) be the length of a face f. Unless otherwise specified, we refer the reader to [1] for notation and definitions. We consider a derived vertex coloring in which each vertex receives a color based on assigned labels of its neighbors. Let l : V (G) R be a labeling of the vertices of a graph G. For each v V (G), let S G (v) = l(u), where N G (v) is the open neighborhood of v in G. When the u N G (v) context is clear we use S(v) in place of S G (v). We say the labeling l is lucky if for every pair of adjacent vertices u and v, we have S(u) S(v); that is S induces a proper vertex coloring of G. The least integer k for which a graph G has a lucky labeling using labels from {1,..., k} is called the lucky number of G, denoted η(g). Determining the lucky number of a graph is a natural variation of a well studied problem posed by Karoński, Luczak and Thomason [9], in which edge labels from {1,..., k} are summed at incident Dept. of Math. and Stat. Sciences, Univ. of Colorado Denver, partially funded by NSF GK-1 Transforming Experiences Grant DGE Dept. of Math. and Stat. Sciences, Univ. of Colorado Denver, Dept. of Math. and Stat. Sciences, Univ. of Colorado Denver, 1

2 vertices to induce a vertex coloring. Karoński, Luczak and Thomason conjecture that edge labels from {1,, } are enough to yield a proper vertex coloring of graphs with no component isomorphic to K. This conjecture is known as the 1,, Conjecture and is still open. In 010, Kalkowski, Karoński and Pfender [8] showed that labels from {1,,, 4, 5} suffice. Similar to the lucky number of a graph, Chartrand, Okamoto, and Zhang [5] defined σ(g) to be the smallest integer k such that G has a lucky labeling using k distinct labels. They showed that σ(g) χ(g). Note that σ(g) η(g), since with η(g) we seek the smallest k such that labels are from {1,..., k}, even if some integers in {1,..., k} are not used as labels, whereas σ(g) considers the fewest distinct labels, regardless of the value of the largest label. In 009, Czerwiński, Grytczuk, and Żelazny proposed the following conjecture for the lucky number of G. Conjecture 1.1 ([6]). For every graph G, η(g) χ(g). This conjecture remains open even for bipartite graphs, for which no constant bound is currently known. Czerwiński, Grytczuk, and Żelazny [6] showed that η(g) k + 1 for every bipartite graph G having an orientation in which each vertex has out-degree at most k. They also showed that η(g) when G is a tree, η(g) when G is bipartite and planar, and η(g) 100, 80, 45, 065 for every planar graph G. Note that if the conjecture is true, then η(g) 4 for any planar graph G. The bound for planar graphs was later improved to η(g) 468 by Bartnicki et al. [], who also show the following. Theorem 1. ([]). If G is a -colorable planar graph, then η(g) 6. The girth of a graph is the length of its shortest cycle, which is especially useful in giving a measure of sparseness. Knowing the girth of a planar graph gives a bound on the maximum average degree of a graph G, denoted mad(g), which is the maximum average degree over all subgraphs of G. The following proposition is a simple application of Euler s formula (see [1]) and gives a relationship between these two parameters. Proposition 1.. If G is a planar graph with girth g, then mad(g) < g g. Bartnicki et al. [] proved the following. Theorem 1.4 ([]). If G is a planar graph of girth at least 1, then η(g) 4. In 01, Akbari et al. [1] proposed the list version of lucky labeling. A graph is lucky k-choosable if whenever each vertex is given a list of at least k available integers, a lucky labeling can be chosen from the lists. The lucky choice number of a graph G is the minimum positive integer k such that G is lucky k-choosable, and is denoted by η l (G). Akbari et al. [1] showed that η l (G) + 1 for every graph G with. They also proved the following. Theorem 1.5 ([1]). If G is a forest, then η l (G). In this paper we improve these results for planar graphs of particular girths. Specifically, we use the Combinatorial Nullstellensatz within reducibility arguments of the discharging method to prove our results. The combination of these two popular techniques is a novel approach that can eliminate a considerable amount of case analysis. Moreover, using the Combinatorial Nullstellensatz in reducibility arguments of coloring problems enables proving choosability results, rather than just colorability. We show the following improvements on the lucky choice number for planar graphs of given girths.

3 Theorem 1.6. Let G be a planar graph with girth g. 1. If g 5, then η l (G) 19.. If g 6, then η l (G) 9.. If g 7, then η l (G) If g 6, then η l (G). Various colorings of planar graphs have been obtained under certain girth assumptions. For example, Grötzsch [7] proved that planar graphs with girth at least 4 are colorable and Thomassen [11] proved that planar graphs with girth at least 5 are list colorable. Combined with Grötzsch s result, our result answers Conjecture 1.1 for non-bipartite planar graphs with girth at least 6. In Section we introduce the notation and tools that are used throughout the remainder of the paper. We also give an overview of how we use the discharging method and the Combinatorial Nullstellensatz. Section describes certain reducible configurations. Finally, in Section 4 we prove Theorem 1.6. Notation and Tools Let N G (v) be the open neighborhood of a vertex v in a graph G. For convenience, a j vertex, j vertex, or j + vertex is a vertex with degree j, at most j, or at least j, respectively. Similarly, a j-neighbor (respectively j neighbor or j + neighbor) of v is a j vertex (respectively j vertex or j + vertex) adjacent to v. For sets A and B of real numbers A B is defined to be the set {a+b: a A, b B}. Likewise, A B is defined to be the set {a b: a A, b B}. When B =, we define A B = A B = A. We use the following known result from additive combinatorics. Proposition.1. Let A 1,..., A r be finite sets of real numbers. We have Proof. We apply induction on A 1 A r 1 + r r ( A i 1). A i. When r A i = 1, all but one A i are empty, so we have A 1 A r = 1, as desired. r Now suppose that A i = n. We may suppose that all A i are nonempty. Let a i be the minimum element of A i for i {1,..., n}. Let A 1 = A 1 {a 1 }. By the induction hypothesis we have A 1 A A r 1 + r ( A i 1) 1. However A 1 A r {a a r } + A 1 A A r. Therefore A 1 A r 1 + r ( A i 1). Note that A ( B) is the same as A B, where B = { b : b B}. This yields the following known corollary.

4 Corollary.. Let A and B be nonempty sets of positive real numbers. A + B 1. We have A B Throughout, we consider when endpoints of edges need different sums to yield a lucky labeling. For this reason, if we know S(u) S(v) for an edge uv of G, we say that uv is satisfied; uv is unsatisfied otherwise. Our proofs rely on applying the discharging method. This proof technique assigns an initial charge to vertices and possibly faces of a graph and then distributes charge according to a list of discharging rules. A configuration is k reducible if it cannot occur in a vertex minimal graph G with η l (G) > k. Note that any k reducible configuration is also (k + 1) reducible. When applying the discharging method in Theorem 4.5 we require the following known lemma, which is a simple application of Euler s Formula (see [1]). Proposition.. Given a planar graph G, (l(f) 4) + f F (G) v V (G) (d(v) 4) = 8. We also require a large independent set, which is given from the following theorem. Theorem.4 ([10]). Every planar triangle-free graph on n vertices has an independent set of size at least n + 1. The main tool we use to determine when configurations are k-reducible is the Combinatorial Nullstellensatz, which is applied to certain graph configurations. Theorem.5 (Combinatorial Nullstellensatz []). Let f be a polynomial of degree t in m variables over a field F. If there is a monomial x t i i in f with t i = t whose coefficient is nonzero in F, then f is nonzero at some point of T i, where each T i is a set of t i + 1 distinct values in F. Reducible Configurations In the lemmas in this section, we let k N and introduce k reducible configurations that will be used to prove our main result. Let L : V (G) R be a function on V (G) such that L(v) = k for each v V (G). Thus L(v) denotes a list of k available labels for v. In each proof we take G to be a vertex minimal graph with η l (G) > k. Then we define a proper subgraph G of G with V (G ) V (G). By the choice of G, G has a lucky labeling l such that l(v) L(v) for all v V (G ). This labeling of G is then extended to a lucky labeling of G by defining l(v) for v V (G) V (G ). We discuss the details of this approach in Lemmas.1 and.. The remaining lemmas are similar in approach, so we include fewer details in the proofs. Lemma.1. The following configurations are k reducible in the class of graphs with girth at least 5. (a) A vertex v with d(u) < k. u N(v) (b) A vertex v with r neighbors of degree 1 and a set Q of neighbors {v 1,..., v q } each having a (k 1) neighbor other than v, say v 1,..., v q, respectively, such that v 1,..., v q are independent and 1 + r(k 1) + (k d(v i ) 1) > d(v). v i Q 4

5 Proof. Assume G is a vertex minimal graph with η l (G) > k containing the configuration described in (a). Let G = G {v}. Since G is vertex minimal, η l (G ) k. Let l be a lucky labeling from L on V (G ). Our aim is to choose l(v) from L(v) to extend the lucky labeling of G to a lucky labeling of G. Note that the only unsatisfied edges of G are those incident to neighbors of v. Let e be an edge incident to a neighbor u of v. If e = uv, then e is satisfied when l(v) l(w) S G (u). If w N(v) e = uw for some w v, then e is satisfied when l(v) S G (w) S G (u). Thus picking l(v) distinct from at most d(u) values ensures that all edges of G are satisfied. Since d(u) < k there u N(v) u N(v) exists l(v) in L(v) that can be used to extend the lucky labeling of G to a lucky labeling of G. Therefore η l (G) k, a contradiction. Now assume G is a vertex minimal graph with girth at least 5 and η l (G) > k containing the configuration described in (b). Let R be the set of r 1 neighbors of v. Let G = G (R Q). Since girth(g) 5, Q is independent. Therefore for each i {1,..., q} there are at least L(v i ) d G (v i ) choices for l(v i ) that ensure all edges incident to v i are satisfied in G. Consider vw in E(G). If w V (G ), vw is satisfied when l(x) S G (w) S G (v). Also, if w R, then vw is satisfied x R Q when l(x) l(v) S G (v). If w = v i for some v i Q, vw is satisfied when l(x) x R Q x R Q l(v)+l(w) S G (v). Therefore, we must avoid at most d(v) values for l(x) in order to satisfy x R Q all edges incident to v. Recall that each vertex in R and Q have k and k d(v i ) labels, respectively, that avoid restricted sums. Proposition.1 guarantees at least 1 + r(k 1) + (k d(v i ) 1) v i Q available values for l(w)+ l(w). Since, by assumption, 1+r(k 1)+ (k d(v i ) 1) > d(v), w R w Q there is at least one choice for l(w) for each w in R Q that completes a lucky labeling of G. Thus η l (G) k, a contradiction. Lemma.. The following configurations are 8-reducible in the class of graphs of girth at least 6. (a) A 6 vertex v having six -neighbors one of which has a neighbor. (b) A 7 vertex v having seven -neighbors two of which have 4 neighbors. Proof. Let G be a vertex minimal graph of girth at least 6 with η l (G) > 8. To the contrary suppose G contains the configuration described in (a). Let u be a neighbor of v having a neighbor. Let G = G {u, v}. Let l : V (G ) R be a lucky labeling of G such that l(v) L(v) for each v V (G). The only unsatisfied edges of G are those incident to neighbors of u or v. To satisfy the unsatisfied edges not incident to u or v, we avoid at most two values from L(u) and at most five values from L(v). Note that L(u) 8 and L(v) 8. Thus there are at least six labels available for u and at least three available for v. To satisfy the edges incident to u or v, l(u) l(v) must avoid at most seven values. Corollary. gives at least eight values for l(u) l(v) from available labels. Thus there are labels that complete a lucky labeling of G. Hence η l (G) 8, a contradiction. v i Q 5

6 v u 1 u u u 4 u 5 u 6 u 7 u 1 u u u 4 u 5 u 6 u 7 w 1 w w w 1 w w Figure 1: An 8 reducible configuration. Now, we prove part (b). To the contrary suppose G contains the configuration described in (b). Let u 1,..., u 7 be the neighbors of v whose other neighbors are u 1,..., u 7, respectively, where u 1 and u are 4 vertices. Since the most restrictions on labels occurs when d(u 1 ) = d(u ) = 4, we assume this is the case. Let N(u 1 ) {u 1} = {w 1, w, w } and N(u ) {u } = {w 1, w, w } (see Figure 1). Consider G = G {v, u 1, u }. Let l : V (G ) R be a lucky labeling of G such that l(v) L(v) for each v V (G). The only unsatisfied edges of G are those incident to u 1, u, and neighbors of v. The following function has factors that correspond to unsatisfied edges, where x, y, and z represent the possible values of l(v), l(u 1 ), and l(u ), respectively f(x, y, z) = y + z + l(u j ) x l(u i) (x + l(u i) S G (u i)) j= (y + S G (u 1) S G (w i )) i= (z + S G (u ) S G (w i)) (x + l(u 1) y S G (u 1)) (x + l(u ) z S G (u )) The coefficient of x 7 y 6 z 7 in f(x, y, z) is equal to its coefficient in (y + z x) 7 x 5 y z (x y)(x z), which is 490. By Theorem.5, there is a choice of labels for l(v), l(u 1 ), and l(u ) from lists of size at least 8 that make f nonzero. Thus these labels induce a lucky labeling of G. Hence η l (G) 8, a contradiction. Lemma.. A configuration that is an induced cycle with vertices v 1 v v v 4 v 5 such that d(v 1 ) 17, d(v ) = d(v 5 ) =, d(v ) 7, and d(v 4 ) 7 is 19 reducible. v 5 v 4 v 1 v v Figure : A reducible configuration. Proof. Let G be a vertex minimal graph with η l (G) > 19. Suppose to the contrary that G contains the configuration in Figure. Since the most restrictions on labels occurs when d(v 1 ) = 17 and 6

7 d(v ) = d(v 4 ) = 7, we assume this is the case. Let G = G {v, v 5 }. Let l : V (G ) R be a lucky labeling of G such that l(v) L(v) for each v V (G). The unsatisfied edges are those incident to v 1,..., v 5. The following function has factors corresponding to the unsatisfied edges where x and x 5 represent labels of v and v 5, respectively. f(x, x 5 ) =(S G (v 1 ) + x + x 5 l(v 1 ) l(v )) (l(v 1 ) + l(v ) x S G (v )) (x + S G (v ) x 5 S G (v 4 )) (x 5 + S G (v 4 ) l(v 1 ) l(v 4 )) (l(v 1 ) + l(v 4 ) x x 5 S G (v 1 )) (S G (w) S G (v 4 ) x 5 ) w N G (v 1 ) (S G (w) S G (v 1 ) x x 5 ) w N G (v 4 ) {v } w N G (v ) {v 4 } (S G (w) S G (v ) x ) The ( coefficient of x 16 x14 5 in f(x, x 5 ) is the same as x 10 x8 5 in (x + x 5 ) 17 (x x 5 ), which is 17 ( 10) 17 ) 9. Theorem.5 gives ηl (G) 19, a contradiction. Lemma.4. Let P (t,..., t n 1 ) be the path v 1 v n such that for each i in {,..., n 1} the vertex v i has t i 1 neighbors and d(v i ) = +t i. The configurations P (1, 0, 1), P (1, 1, 1), P (1, 1, 0, 0), P (0, 1, 0, 0), P (1, 0, 0, 0), and P (0, 0, 0, 0, 0) are reducible. v 6 v 7 v 6 v 7 v 8 v 7 v 8 v 1 v v v 4 v 5 (a) v 7 v 1 v v v 4 v 5 v 7 (b) v 1 v v v 4 v 5 v 6 (c) v 1 v v v 4 v 5 v 6 (d) v 1 v v v 4 v 5 v 6 (e) v 1 v v v 4 v 5 v 6 v 7 (f) Figure : Some reducible configurations. Proof. Let G be a vertex minimal graph with η l (G) >. We proceed as in earlier proofs presenting the proper subgraph G, the function f derived from the configuration, the monomial, and its coefficient. In each function f, x i corresponds to the label of v i. Suppose G contains P (1, 0, 1), see Figure a. Let G = G {v, v 6, v 7 }. f(x, x 6, x 7 ) = (S G (v 1 ) l(v 1 ) x x 6 ) (l(v 1 ) + x + x 6 l(v )) (l(v 1 ) + x + x 6 l(v ) l(v 4 )) (l(v ) + l(v 4 ) S G (v 4 ) x x 7 ) (l(v 5 ) + x + x 7 l(v 4 )) (l(v 5 ) + x + x 7 S G (v 5 )) The coefficient of x x 6 x 7 is 9. Suppose G contains P (1, 1, 1), see Figure b. Let G = G {v, v 6, v 7, v 8 }. f(x, x 6, x 7, x 8 ) = (S G (v 1 ) l(v 1 ) x x 6 ) (l(v 1 ) + x + x 6 l(v )) (l(v 1 ) + x + x 6 l(v ) x 7 l(v 4 )) (l(v ) + l(v 4 ) + x 7 x ) (l(v ) + l(v 4 ) + x 7 l(v 5 ) x x 8 ) (l(v 5 ) + x + x 8 l(v 4 )) (l(v 5 ) + x + x 8 S G (v 5 )) 7

8 The coefficient of x x 6 x 7x 8 is 15. Suppose G contains P (1, 1, 0, 0), see Figure c. Let G = G {v, v 4, v 7, v 8 }. f(x, x 4, x 7, x 8 ) = (x + x 7 + l(v 1 ) S G (v 1 )) (x + x 7 + l(v 1 ) l(v )) (x 4 + x 8 + l(v ) x x 7 l(v 1 )) (x 4 + x 8 + l(v ) x ) (x 4 + x 8 + l(v ) x l(v 5 )) (x + l(v 5 ) x 4 l(v 6 )) (x 4 + l(v 6 ) S G (v 6 )) The coefficient of x x 4 x 7 x 8 is 8. Suppose G contains P (0, 1, 0, 0), see Figure d. Let G = G {v, v 4, v 7 }. f(x, x 4, x 7 ) = (S G (v 1 ) l(v 1 ) x ) (l(v 1 ) + x l(v ) x 7 x 4 ) (l(v ) + x 7 + x 4 x ) (l(v ) + x 7 + x 4 x l(v 5 )) (x + l(v 5 ) x 4 l(v 6 )) (x 4 + l(v 6 ) S G (v 6 )) The coefficient of x x 4 x 7 is 6. Suppose G contains P (1, 0, 0, 0), see Figure e. Let G = G {v, v 4, v 7 }. f(x, x 4, x 7 ) = (S G (v 1 ) l(v 1 ) x x 7 ) (l(v ) l(v 1 ) x x 7 ) (l(v ) + x 4 l(v 1 ) x x 7 ) (l(v ) + x 4 x l(v 5 )) (l(v 6 ) + x 4 x l(v 5 )) (l(v 6 ) + x 4 S G (v 6 )) The coefficient of x x 4 x 7 is 7. Suppose G contains P (0, 0, 0, 0, 0), see Figure f. Let G = G {v, v 4, v 5 }. f(x, x 4, x 5 ) = (S G (v 1 ) l(v 1 ) x ) (l(v 1 ) + x l(v ) x 4 ) (l(v ) + x 4 x x 5 ) (x + x 5 x 4 l(v 6 )) (x 4 + l(v 6 ) x 5 l(v 7 )) (x 5 + l(v 7 ) S G (v 7 )) The coefficient of x x 4 x 5 is 7. Theorem.5 implies that these configurations are reducible. 4 Proof of Main Results Theorem 4.1. If G is a planar graph with girth(g) 5, then η l (G) 19. Proof. Let G be a planar graph with girth at least 5 and suppose that G is vertex minimal with η l (G) > 19. By Proposition 1., mad(g) < 10/. Assign each vertex v an initial charge d(v), and apply the following discharging rules. (R1) Each 1 vertex receives 7/ charge from its neighbor. (R) Each vertex (a) with two 8 + neighbors receives / charge from each neighbor. (b) with a 4 neighbor and a 15 + neighbor receives 4/ charge from its 15 + neighbor. (c) with a 10 + neighbor and a neighbor of degree 5, 6, or 7 receives 1 charge from its 10 + neighbor and 1/ charge from its other neighbor. (R) Each vertex receives 1/ charge from a 6 + neighbor. 8

9 A contradiction with mad(g) < 10/ occurs if the discharging rules reallocate charge so that every vertex has final charge at least 10/; we show that this is the case. By Lemma.1 (a), each 1 vertex has a 19 + neighbor, vertices have neighbors with degree sum at least 19, and vertices have at least one 6 + neighbor. Thus, by the discharging rules, vertices have final charge 10/. Since 4 vertices neither give nor receive charge, they have final charge 4. Vertices of degree d with d {5, 6, 7} give charge when incident to vertices. By the discharging rules, they give away at most d/ charge. This results in a final charge of at least d d = d 10, since d 5. Vertices of degree d with d {8, 9}. By Lemma.1 (a) each 9 vertex has at least one + neighbor. Also, each 8 vertex has at least two + neighbors or at least one 4 + neighbor. By the discharging rules, the final charge of any 9 vertex is at least = 10 and the final charge of any 8 vertex is at least min{8 6 1, 8 7 } = 10. Vertices of degree d with d {10, 11}. By Lemma.1 (b), these vertices have no neighbors with a 7 neighbor. Thus, these vertices have final charge at least d d = d 10, since d 10. Let v have degree d where d {1, 1, 14}. By Lemma.1 (b), v has no neighbor with a 4 neighbor. By Lemma.1 (b) and Lemma., v has at most two neighbors each having a 7 neighbor. By the discharging rules v has final charge at least d (1) (d ) ( ) = d 10, since d 1. Similarly, by Lemma.1 (b) and Lemma. vertices of degree 15, 16, or 17 have at most one neighbor with 7 neighbors. Thus these vertices give at most 1( 4 ) + (d 1) charge. Hence they have final charge at least d 1, since d 15. Finally, consider an 18 + vertex v of degree d. Let r be the number of 1 neighbors of v. Let U = {u 1, u,..., u q } be the set of neighbors of v. For each u i let N(u i ) {v} = {u i }. Let T = {u i U : d(u i ) 7} and let T = t. Since G[T ] is planar with girth at least 5, Theorem.4 guarantees at least t+1 vertices in T that form an independent set. By Lemma.1 (b), d 18r + 11( t+1 ) + 1. Thus d 18r + 11 t (1) The final charge of v is at least d 7 r 4 t (d r t). Hence v has final charge at least d 5 r t. From (1), d 5 r t 1 r t When r 1 or t 4, the final charge is at least 10. When r = 0 and t, the vertex v has final charge at least d 4 t d 6 (d t) 1, since d 18. Theorem 4.. If G is a planar graph with girth(g) 6, then η l (G) 9. Proof. Let G be a planar graph with girth at least 6 and suppose G is vertex minimal with η l (G) > 9. By Proposition 1., mad(g) <. Assign each vertex v an initial charge of d(v) and apply the following discharging rules. (R1) Each 1 vertex receives charges from its neighbor. (R) Each vertex (a) with one 8 + neighbor and one 5 neighbor receives 1 charge from its 8 + neighbor. (b) with one 7 + neighbor and one 4 neighbor receives 1 charge from its 7 + neighbor. 9

11 By Lemma.1 (a) each 1 vertex has an 8 + neighbor and each vertex has neighbors with degree sum at least 8. Under the discharging rules, 1 vertices and vertices gain 9/5 and 4/5 charge, respectively. If v is a vertex, then by Lemma.1 (b), v has at most one neighbor with a 5 neighbor other than v. Thus v gives at most 1/5 charge. Hence, vertices have final charge at least 14/5. If v is a 4 vertex, then by Lemma.1 (b) v has at most one neighbor with a 4 neighbor other than v. Thus v has final charge at least 4 1 ( ( 1 =. If v is a 5 vertex, then by Lemma.1 (b) v has at most one neighbor with a 4 neighbor. Thus v has final charge at least 5 1 ( ( 4 ) If v is a 6 vertex, then by Lemma.1 (b) v has at most one neighbor with a neighbor, and at most one neighbor having a 4 neighbor. Thus v has final charge at least 6 1 ( 4 1 ( ( 4 =. If v is a 7 vertex, then by Lemma.1 (b) v has at most one neighbor with a neighbor, and has at most two neighbors with a 4 neighbor. Thus v has final charge at least 7 1 ( 4 ( ( 4 ) 5 = If v is an 8 vertex, then by Lemma.1 (b) v has at most one 1 neighbors, at most two neighbors with a neighbor, and at most two neighbors with a 4 neighbor. Moreover, if v has a 1 neighbor, then v does not have a neighbor with a neighbor. Since the discharging rules allocate charge to neighbors with these constraints, v has final charge at least 8 max { 1 ( ( (, 4 ( + 6 )} 5 = If v is a d vertex with d 9, then by Lemma.1 (b) v has at most d 8 1 neighbors, at most d 4 neighbors that are either a 1 vertex or a vertex with a neighbor, and at most d neighbors that are either a 1 vertex or a vertex with a 4 neighbor. Since v gives more charge to neighbors of low degree, we assume v has as many low degree neighbors as possible. Hence v has final charge at least d d ( 9 ) ( 8 5 d 4 d ) ( 4 ) ( 8 5 d d ) ( ) ( ( 4 5 d d ) ) 5 = 4 10d, which is at least since d 9. Therefore, all vertices have final charge at least 14/5 and we obtain a contradiction. We call a d-vertex lonely if it is in exactly one face of G. We say that a non lonely + vertex v is unique to a face f of G if it is incident to a cut edge uv such that d(u) > 1 and uv is also in f. Lemma 4.4. Let f be a face in a planar graph G with e c cut edges such that f has s lonely vertices, and t + vertices unique to f. We have s + t e c. Proof. We apply induction on e c. If e c = 0, then s = t = 0 and the inequality holds. In the following two cases, given some face f containing a cut edge uv, let G be the graph obtained by contracting the edge uv to a vertex w. Let f be the face in G corresponding to f. Let s and t be the number of lonely vertices in f and the number of + vertices unique to f, respectively. Case 1: u or v is lonely. Without loss of generality assume u is lonely. If v is also lonely, then w is lonely and therefore s = s 1. If v is not lonely, then w is not lonely and still s = s 1. Vertices unique to f are not affected by the contraction, thus t = t. Since f has e c 1 cut edges, by the induction hypothesis s + t e c 1. Therefore, s + t e c. Case : u and v are unique to f. Since u and v are not lonely, w is not lonely and s = s. After contracting uv, either w is unique to f and t = t 1 or w is not unique to f and t = t, which yields t + 1 t t +. By the induction hypothesis, s + t e c 1. Since t t +, we have s + t e c, as desired. 11

13 A combination of the reducible configurations in Lemma. implies that there are at most four consecutive vertices from R f in any cycle of f. Thus 4 r (l(f) s t). (4) 5 By the discharging rules, f has final charge at least By (4), l(f) s t r 1 (l(f) s t r) = l(f) 4 s t r. l(f) 4 s t r l(f) 4 s t 4 (l(f) s t). ( 5 Therefore the final charge of f is at least l(f) 4 s t ( 4 (l(f) s t) 5 ) = (l(f) s t), 15 which is at least 4 when l(f) s 5 0. When l(f) {6,..., 9}, ( gives final charge at least 4. Since [5] shows σ(c n ) = χ(c n ) for n and σ(g) η(g), we have η(c n+1 ) for n 1. By Theorem 4.5, we have the following immediate corollary. Corollary 4.6. If n 1, then η l (C n+1 ) =. 5 Acknowledgements The authors would like to thank Michael Ferrara for his helpful suggestions regarding this paper. They would also like to acknowledge Kapil Nepal for his early contributions in this project. References [1] S. Akbari, M. Ghanbari, R. Manaviyat, and S. Zare. On the lucky choice number of graphs. Graphs and Combinatorics, 9:157 16, 01. [] N. Alon. Combinatorial Nullstellensatz. Combin. Probab. Comput., 8:7 9, Recent trends in combinatorics (Mátraháza, 199. [] T. Bartnicki, B. Bosek, S. Czerwiński, J. Grytczuk, G. Matecki, and W. Żelazny. Additive colorings of planar graphs. Graphs and Combinatorics, pages 1 1, 01. [4] O. V. Borodin, A. V. Kostochka, J. Nešetřil, A. Raspaud, and E. Sopena. On the maximum average degree and the oriented chromatic number of a graph. Discrete Mathematics, 06(1):77 89, [5] G. Chartrand, F. Okamoto, and P. Zhang. The sigma chromatic number of a graph. Graphs and Combinatorics, 6:755 77,

14 [6] S. Czerwiński, J. Grytczuk, and W. Żelazny. Lucky labelings of graphs. Information Processing Letters, 109: , 009. [7] H. Grötzsch. Zur Theorie der diskreten Gebilde. VII. Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg. Math.-Nat. Reihe, 8:109 10, [8] M. Kalkowski, M. Karoński, and F. Pfender. Vertex-coloring edge-weightings: Towards the 1---conjecture. J. Combin. Theory Series B, 100():47 49, May 010. [9] M. Karoński, T. Luczak, and A. Thomason. Edge weights and vertex colours. J. Combin. Theory Series B, 91: , 004. [10] R. Steinberg and C. A. Tovey. Planar Ramsey numbers. J. Combin. Theory Ser. B, 59():88 96, 199. [11] C. Thomassen. A short list color proof of Grötzsch s theorem. J. Combin. Theory Ser. B, 88:189 19, 00. [1] D. B. West. Introduction to graph theory. Prentice Hall, Inc., Upper Saddle River, NJ,

### Total colorings of planar graphs with small maximum degree

Total colorings of planar graphs with small maximum degree Bing Wang 1,, Jian-Liang Wu, Si-Feng Tian 1 Department of Mathematics, Zaozhuang University, Shandong, 77160, China School of Mathematics, Shandong

### DO NOT RE-DISTRIBUTE THIS SOLUTION FILE

Professor Kindred Math 04 Graph Theory Homework 7 Solutions April 3, 03 Introduction to Graph Theory, West Section 5. 0, variation of 5, 39 Section 5. 9 Section 5.3 3, 8, 3 Section 7. Problems you should

### Planarity Planarity

Planarity 8.1 71 Planarity Up until now, graphs have been completely abstract. In Topological Graph Theory, it matters how the graphs are drawn. Do the edges cross? Are there knots in the graph structure?

### Partitioning edge-coloured complete graphs into monochromatic cycles and paths

arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edge-coloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political

### Labeling outerplanar graphs with maximum degree three

Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics

### Solutions to Exercises 8

Discrete Mathematics Lent 2009 MA210 Solutions to Exercises 8 (1) Suppose that G is a graph in which every vertex has degree at least k, where k 1, and in which every cycle contains at least 4 vertices.

### Coloring Eulerian triangulations of the projective plane

Coloring Eulerian triangulations of the projective plane Bojan Mohar 1 Department of Mathematics, University of Ljubljana, 1111 Ljubljana, Slovenia bojan.mohar@uni-lj.si Abstract A simple characterization

### An inequality for the group chromatic number of a graph

An inequality for the group chromatic number of a graph Hong-Jian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics

### Homework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS

Homework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS 1.1.25 Prove that the Petersen graph has no cycle of length 7. Solution: There are 10 vertices in the Petersen graph G. Assume there is a cycle C

### Cycles in a Graph Whose Lengths Differ by One or Two

Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS

### Fall 2015 Midterm 1 24/09/15 Time Limit: 80 Minutes

Math 340 Fall 2015 Midterm 1 24/09/15 Time Limit: 80 Minutes Name (Print): This exam contains 6 pages (including this cover page) and 5 problems. Enter all requested information on the top of this page,

### The 4-Choosability of Plane Graphs without 4-Cycles*

Journal of Combinatorial Theory, Series B 76, 117126 (1999) Article ID jctb.1998.1893, available online at http:www.idealibrary.com on The 4-Choosability of Plane Graphs without 4-Cycles* Peter Che Bor

### Unicyclic Graphs with Given Number of Cut Vertices and the Maximal Merrifield - Simmons Index

Filomat 28:3 (2014), 451 461 DOI 10.2298/FIL1403451H Published by Faculty of Sciences Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Unicyclic Graphs with Given Number

### Basic Notions on Graphs. Planar Graphs and Vertex Colourings. Joe Ryan. Presented by

Basic Notions on Graphs Planar Graphs and Vertex Colourings Presented by Joe Ryan School of Electrical Engineering and Computer Science University of Newcastle, Australia Planar graphs Graphs may be drawn

### Mean Ramsey-Turán numbers

Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average

### On the maximum average degree and the incidence chromatic number of a graph

Discrete Mathematics and Theoretical Computer Science DMTCS ol. 7, 2005, 203 216 On the maximum aerage degree and the incidence chromatic number of a graph Mohammad Hosseini Dolama 1 and Eric Sopena 2

### An inequality for the group chromatic number of a graph

Discrete Mathematics 307 (2007) 3076 3080 www.elsevier.com/locate/disc Note An inequality for the group chromatic number of a graph Hong-Jian Lai a, Xiangwen Li b,,1, Gexin Yu c a Department of Mathematics,

### Divisor graphs have arbitrary order and size

Divisor graphs have arbitrary order and size arxiv:math/0606483v1 [math.co] 20 Jun 2006 Le Anh Vinh School of Mathematics University of New South Wales Sydney 2052 Australia Abstract A divisor graph G

### Chapter 4. Trees. 4.1 Basics

Chapter 4 Trees 4.1 Basics A tree is a connected graph with no cycles. A forest is a collection of trees. A vertex of degree one, particularly in a tree, is called a leaf. Trees arise in a variety of applications.

### On the independence number of graphs with maximum degree 3

On the independence number of graphs with maximum degree 3 Iyad A. Kanj Fenghui Zhang Abstract Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs

### M-Degrees of Quadrangle-Free Planar Graphs

M-Degrees of Quadrangle-Free Planar Graphs Oleg V. Borodin, 1 Alexandr V. Kostochka, 1,2 Naeem N. Sheikh, 2 and Gexin Yu 3 1 SOBOLEV INSTITUTE OF MATHEMATICS NOVOSIBIRSK 630090, RUSSIA E-mail: brdnoleg@math.nsc.ru

### Graph Theory. Introduction. Distance in Graphs. Trees. Isabela Drămnesc UVT. Computer Science Department, West University of Timişoara, Romania

Graph Theory Introduction. Distance in Graphs. Trees Isabela Drămnesc UVT Computer Science Department, West University of Timişoara, Romania November 2016 Isabela Drămnesc UVT Graph Theory and Combinatorics

### Combinatorics: The Fine Art of Counting

Combinatorics: The Fine Art of Counting Week 9 Lecture Notes Graph Theory For completeness I have included the definitions from last week s lecture which we will be using in today s lecture along with

### Cycles and clique-minors in expanders

Cycles and clique-minors in expanders Benny Sudakov UCLA and Princeton University Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor

### The chromatic spectrum of mixed hypergraphs

The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex

### Math 443/543 Graph Theory Notes 4: Connector Problems

Math 443/543 Graph Theory Notes 4: Connector Problems David Glickenstein September 19, 2012 1 Trees and the Minimal Connector Problem Here is the problem: Suppose we have a collection of cities which we

### (Vertex) Colorings. We can properly color W 6 with. colors and no fewer. Of interest: What is the fewest colors necessary to properly color G?

Vertex Coloring 2.1 33 (Vertex) Colorings Definition: A coloring of a graph G is a labeling of the vertices of G with colors. [Technically, it is a function f : V (G) {1, 2,...,l}.] Definition: A proper

### Best Monotone Degree Bounds for Various Graph Parameters

Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer

### Product irregularity strength of certain graphs

Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (014) 3 9 Product irregularity strength of certain graphs Marcin Anholcer

### SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

### Generalizing the Ramsey Problem through Diameter

Generalizing the Ramsey Problem through Diameter Dhruv Mubayi Submitted: January 8, 001; Accepted: November 13, 001. MR Subject Classifications: 05C1, 05C15, 05C35, 05C55 Abstract Given a graph G and positive

### COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

### THE 0/1-BORSUK CONJECTURE IS GENERICALLY TRUE FOR EACH FIXED DIAMETER

THE 0/1-BORSUK CONJECTURE IS GENERICALLY TRUE FOR EACH FIXED DIAMETER JONATHAN P. MCCAMMOND AND GÜNTER ZIEGLER Abstract. In 1933 Karol Borsuk asked whether every compact subset of R d can be decomposed

### Lecture 4: The Chromatic Number

Introduction to Graph Theory Instructor: Padraic Bartlett Lecture 4: The Chromatic Number Week 1 Mathcamp 2011 In our discussion of bipartite graphs, we mentioned that one way to classify bipartite graphs

### HOMEWORK #3 SOLUTIONS - MATH 3260

HOMEWORK #3 SOLUTIONS - MATH 3260 ASSIGNED: FEBRUARY 26, 2003 DUE: MARCH 12, 2003 AT 2:30PM (1) Show either that each of the following graphs are planar by drawing them in a way that the vertices do not

### Ph.D. Thesis. Judit Nagy-György. Supervisor: Péter Hajnal Associate Professor

Online algorithms for combinatorial problems Ph.D. Thesis by Judit Nagy-György Supervisor: Péter Hajnal Associate Professor Doctoral School in Mathematics and Computer Science University of Szeged Bolyai

### SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov

Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices

### On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that

### 1 Plane and Planar Graphs. Definition 1 A graph G(V,E) is called plane if

Plane and Planar Graphs Definition A graph G(V,E) is called plane if V is a set of points in the plane; E is a set of curves in the plane such that. every curve contains at most two vertices and these

### COLORED GRAPHS AND THEIR PROPERTIES

COLORED GRAPHS AND THEIR PROPERTIES BEN STEVENS 1. Introduction This paper is concerned with the upper bound on the chromatic number for graphs of maximum vertex degree under three different sets of coloring

### Large induced subgraphs with all degrees odd

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

### Chapter 8 Independence

Chapter 8 Independence Section 8.1 Vertex Independence and Coverings Next, we consider a problem that strikes close to home for us all, final exams. At the end of each term, students are required to take

### The positive minimum degree game on sparse graphs

The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University

### Characterizations of Arboricity of Graphs

Characterizations of Arboricity of Graphs Ruth Haas Smith College Northampton, MA USA Abstract The aim of this paper is to give several characterizations for the following two classes of graphs: (i) graphs

### A 2-factor in which each cycle has long length in claw-free graphs

A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

### Extremal Graphs without Three-Cycles or Four-Cycles

Extremal Graphs without Three-Cycles or Four-Cycles David K. Garnick Department of Computer Science Bowdoin College Brunswick, Maine 04011 Y. H. Harris Kwong Department of Mathematics and Computer Science

### Intersection Dimension and Maximum Degree

Intersection Dimension and Maximum Degree N.R. Aravind and C.R. Subramanian The Institute of Mathematical Sciences, Taramani, Chennai - 600 113, India. email: {nraravind,crs}@imsc.res.in Abstract We show

### Edge looseness of plane graphs

Also available at http://amc-journal.eu ISSN 1855-966 (printed edn.), ISSN 1855-974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 9 (015) 89 96 Edge looseness of plane graphs Július Czap Department of

### Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that. a = bq + r and 0 r < b.

Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that a = bq + r and 0 r < b. We re dividing a by b: q is the quotient and r is the remainder,

### Uniform Multicommodity Flow through the Complete Graph with Random Edge-capacities

Combinatorics, Probability and Computing (2005) 00, 000 000. c 2005 Cambridge University Press DOI: 10.1017/S0000000000000000 Printed in the United Kingdom Uniform Multicommodity Flow through the Complete

### Definition. A graph is a collection of vertices, and edges between them. They are often represented by a drawing:

1. GRAPHS AND COLORINGS Definition. A graph is a collection of vertices, and edges between them. They are often represented by a drawing: 3 vertices 3 edges 4 vertices 4 edges 4 vertices 6 edges A graph

### Planar Tree Transformation: Results and Counterexample

Planar Tree Transformation: Results and Counterexample Selim G Akl, Kamrul Islam, and Henk Meijer School of Computing, Queen s University Kingston, Ontario, Canada K7L 3N6 Abstract We consider the problem

### GRAPH THEORY LECTURE 4: TREES

GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection

### UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE

UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE ANDREW LUM ADVISOR: DAVID GUICHARD ABSTRACT. L(2,1)-labeling was first defined by Jerrold Griggs [Gr, 1992] as a way to use graphs

### ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS

ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS M. AXTELL, J. COYKENDALL, AND J. STICKLES Abstract. We recall several results of zero divisor graphs of commutative rings. We

### Discrete Mathematics Problems

Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 E-mail: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................

### BOUNDARY EDGE DOMINATION IN GRAPHS

BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 0-4874, ISSN (o) 0-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 5(015), 197-04 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA

### On Total Domination in Graphs

University of Houston - Downtown Senior Project - Fall 2012 On Total Domination in Graphs Author: David Amos Advisor: Dr. Ermelinda DeLaViña Senior Project Committee: Dr. Sergiy Koshkin Dr. Ryan Pepper

### Chromatic-choosability of the power of graphs

Chromatic-choosability of the power of graphs arxiv:109.0888v1 [math.co] 4 Sep 201 Seog-Jin Kim Young Soo Kwon Boram Park Abstract The kth power G k of a graph G is the graph defined on V(G) such that

### Sparse halves in dense triangle-free graphs

Sparse halves in dense triangle-free graphs Sergey Norin a,1 Liana E. Yepremyan b, a Department of Mathematics and Statistics McGill University Montréal, Canada b School of Computer Science McGill University

### 7. Colourings. 7.1 Vertex colouring

7. Colourings Colouring is one of the important branches of graph theory and has attracted the attention of almost all graph theorists, mainly because of the four colour theorem, the details of which can

### Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph

### Exponential time algorithms for graph coloring

Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A k-labeling of vertices of a graph G(V, E) is a function V [k].

### 9.1. Vertex colouring. 9. Graph colouring. Vertex colouring.

Vertex colouring. 9. Graph colouring k-vertex-critical graphs Approximation algorithms Upper bounds for the vertex chromatic number Brooks Theorem and Hajós Conjecture Chromatic Polynomials Colouring of

### Sample Problems in Discrete Mathematics

Sample Problems in Discrete Mathematics This handout lists some sample problems that you should be able to solve as a pre-requisite to Computer Algorithms Try to solve all of them You should also read

### Planar Graph and Trees

Dr. Nahid Sultana December 16, 2012 Tree Spanning Trees Minimum Spanning Trees Maps and Regions Eulers Formula Nonplanar graph Dual Maps and the Four Color Theorem Tree Spanning Trees Minimum Spanning

### Every tree contains a large induced subgraph with all degrees odd

Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University

### Introduction to Graph Theory

Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate

### Odd induced subgraphs in graphs of maximum degree three

Odd induced subgraphs in graphs of maximum degree three David M. Berman, Hong Wang, and Larry Wargo Department of Mathematics University of New Orleans New Orleans, Louisiana, USA 70148 Abstract A long-standing

### Tools for parsimonious edge-colouring of graphs with maximum degree three. J.L. Fouquet and J.M. Vanherpe. Rapport n o RR-2010-10

Tools for parsimonious edge-colouring of graphs with maximum degree three J.L. Fouquet and J.M. Vanherpe LIFO, Université d Orléans Rapport n o RR-2010-10 Tools for parsimonious edge-colouring of graphs

### Approximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques. My T. Thai

Approximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques My T. Thai 1 Overview An overview of LP relaxation and rounding method is as follows: 1. Formulate an optimization

### Midterm Practice Problems

6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator

### 136 CHAPTER 4. INDUCTION, GRAPHS AND TREES

136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics

### Chapter 6: Colouring Graphs

17 Coloring Vertices Chapter 6: Colouring Graphs 1. Sections 17-19: Qualitative (Can we color a graph with given colors?) Section 20: Quantitative (How many ways can the coloring be done?) 2. Definitions:

### A Turán Type Problem Concerning the Powers of the Degrees of a Graph

A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:

### A CHARACTERIZATION OF TREE TYPE

A CHARACTERIZATION OF TREE TYPE LON H MITCHELL Abstract Let L(G) be the Laplacian matrix of a simple graph G The characteristic valuation associated with the algebraic connectivity a(g) is used in classifying

### Rational exponents in extremal graph theory

Rational exponents in extremal graph theory Boris Bukh David Conlon Abstract Given a family of graphs H, the extremal number ex(n, H) is the largest m for which there exists a graph with n vertices and

### Zachary Monaco Georgia College Olympic Coloring: Go For The Gold

Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various

### All trees contain a large induced subgraph having all degrees 1 (mod k)

All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New

### Diameter of paired domination edge-critical graphs

AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 40 (2008), Pages 279 291 Diameter of paired domination edge-critical graphs M. Edwards R.G. Gibson Department of Mathematics and Statistics University of Victoria

### (a) (b) (c) Figure 1 : Graphs, multigraphs and digraphs. If the vertices of the leftmost figure are labelled {1, 2, 3, 4} in clockwise order from

4 Graph Theory Throughout these notes, a graph G is a pair (V, E) where V is a set and E is a set of unordered pairs of elements of V. The elements of V are called vertices and the elements of E are called

### Connectivity and cuts

Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every

### Network File Storage with Graceful Performance Degradation

Network File Storage with Graceful Performance Degradation ANXIAO (ANDREW) JIANG California Institute of Technology and JEHOSHUA BRUCK California Institute of Technology A file storage scheme is proposed

### Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs

MCS-236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set

### Forests and Trees: A forest is a graph with no cycles, a tree is a connected forest.

2 Trees What is a tree? Forests and Trees: A forest is a graph with no cycles, a tree is a connected forest. Theorem 2.1 If G is a forest, then comp(g) = V (G) E(G). Proof: We proceed by induction on E(G).

### CHROMATIC POLYNOMIALS OF PLANE TRIANGULATIONS

990, 2005 D. R. Woodall, School of Mathematical Sciences, University of Nottingham CHROMATIC POLYNOMIALS OF PLANE TRIANGULATIONS. Basic results. Throughout this survey, G will denote a multigraph with

### MATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:

MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,

### Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem. Senior Exercise in Mathematics. Jennifer Garbett Kenyon College

Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem Senior Exercise in Mathematics Jennifer Garbett Kenyon College November 18, 010 Contents 1 Introduction 1 Primitive Lattice Triangles 5.1

### Chapter 6 Planarity. Section 6.1 Euler s Formula

Chapter 6 Planarity Section 6.1 Euler s Formula In Chapter 1 we introduced the puzzle of the three houses and the three utilities. The problem was to determine if we could connect each of the three utilities

### Chapter I Logic and Proofs

MATH 1130 1 Discrete Structures Chapter I Logic and Proofs Propositions A proposition is a statement that is either true (T) or false (F), but or both. s Propositions: 1. I am a man.. I am taller than

### Oriented Diameter of Graphs with Diameter 3

Oriented Diameter of Graphs with Diameter 3 Peter K. Kwok, Qi Liu, Douglas B. West revised November, 2008 Abstract In 1978, Chvátal and Thomassen proved that every 2-edge-connected graph with diameter

### MIX-DECOMPOSITON OF THE COMPLETE GRAPH INTO DIRECTED FACTORS OF DIAMETER 2 AND UNDIRECTED FACTORS OF DIAMETER 3. University of Split, Croatia

GLASNIK MATEMATIČKI Vol. 38(58)(2003), 2 232 MIX-DECOMPOSITON OF THE COMPLETE GRAPH INTO DIRECTED FACTORS OF DIAMETER 2 AND UNDIRECTED FACTORS OF DIAMETER 3 Damir Vukičević University of Split, Croatia

### 2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

### Minimum degree condition forcing complete graph immersion

Minimum degree condition forcing complete graph immersion Matt DeVos Department of Mathematics Simon Fraser University Burnaby, B.C. V5A 1S6 Jacob Fox Department of Mathematics MIT Cambridge, MA 02139

### 1. Relevant standard graph theory

Color identical pairs in 4-chromatic graphs Asbjørn Brændeland I argue that, given a 4-chromatic graph G and a pair of vertices {u, v} in G, if the color of u equals the color of v in every 4-coloring

### The minimum number of monochromatic 4-term progressions

The minimum number of monochromatic 4-term progressions Rutgers University May 28, 2009 Monochromatic 3-term progressions Monochromatic 4-term progressions 1 Introduction Monochromatic 3-term progressions

### 6. GRAPH AND MAP COLOURING

6. GRPH ND MP COLOURING 6.1. Graph Colouring Imagine the task of designing a school timetable. If we ignore the complications of having to find rooms and teachers for the classes we could propose the following

### Induction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition

Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing