# Online Ramsey Theory for Planar Graphs

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Online Ramsey Theory for Planar raphs Šárka Petříčková Department of Mathematics University of West Bohemia Univerzitní 8, Plzeň, Czech Republic Submitted: Dec 1, 2012; Accepted: Mar 10, 2014; Published: Mar 24, 2014 Mathematics Subject Classification: 05C15, 05D10, 91A46 Abstract An online Ramsey game (, H) is a game between Builder and Painter, alternating in turns. During each turn, Builder draws an edge, and Painter colors it blue or red. Builder s goal is to force Painter to create a monochromatic copy of, while Painter s goal is to prevent this. The only limitation for Builder is that after each of his moves, the resulting graph has to belong to the class of graphs H. It was conjectured by rytczuk, Ha luszczak, and Kierstead (2004) that if H is the class of planar graphs, then Builder can force a monochromatic copy of a planar graph if and only if is outerplanar. Here we show that the only if part does not hold while the if part does. Keywords: Ramsey theory; Online Ramsey games; Planar graphs; Outerplanar graphs; ame theory; Builder and Painter 1 Introduction For a fixed graph and a class of graphs H such that H, an online Ramsey game (, H), defined by rytczuk, Ha luszczak, and Kierstead [5], is a game between Builder and Painter with the following rules. The game starts with the empty graph on infinitely many vertices. On the i-th turn, Builder adds a new edge to the graph created in the first i 1 turns so that the resulting graph belongs to H (we say that Builder plays on H), and Painter colors this edge blue or red. Builder wins if he can always force Painter to create a monochromatic copy of (or force for short). We then say that is unavoidable on H. A graph is unavoidable if it is unavoidable on planar graphs. On the other hand, if Painter can ensure that a monochromatic copy of is never created, then is avoidable on H. A class of graphs H is self-unavoidable if every graph of H is unavoidable on H. According to Ramsey s theorem, for every t N there exists n N such that every 2-coloring of the edges of K n contains a monochromatic copy of K t. Thus, without the electronic journal of combinatorics 21(1) (2014), #P1.64 1

2 restricting to H, Builder would always win the online Ramsey game by creating sufficiently large complete graph. The size Ramsey number r() for a graph is the minimum number of edges of a graph that contains a monochromatic copy of in every 2-coloring of its edges. The online size Ramsey number r() is the minimum m such that Builder can force by playing on the class of graphs with at most m edges. Clearly, r() r() (Builder wins by presenting a graph of size r() that contains a monochromatic copy of for any 2-edge-coloring). However, Builder may be able to win using less than r() edges since he can adapt his strategy to Painter s coloring. One can then ask whether or not r() = o(r()). The basic conjecture in the field, attributed to Rödl by Kurek and Ruciński [9], is that r(k t ) = o(r(k t )). In 2009, Conlon [3] showed that r(k t ) t (r(k t )) for infinitely many t. On the other hand, if is a path or a cycle, then both r() and r() are linear in V () (see [1], [6], [7]). Butterfield et al. [2] studied Online Ramsey games played on the class S k of graphs with maximum degree at most k. The authors introduce an online degree Ramsey number r () as the least k for which is unavoidable on S k. Online Ramsey games played on various classes of graphs were studied by rytczuk et al. [5]. They proved that the class of k-colorable graphs as well as the class of forests are self-unavoidable. (It was later shown by Kierstead and Konjevod [8] that the k-colorable graphs are self-unavoidable even if Painter uses more colors.) Various games played on planar graphs were investigated in [5]. It was shown, for example, that every cycle, as well as the graph K 4 e, is unavoidable on planar graphs. They made the following conjecture: Conjecture ([5]). The class of graphs unavoidable on planar graphs is exactly the class of outerplanar graphs. Here we show that the conjecture is only partially true. In particular, it is true that the class of outerplanar graphs is a subclass of the class of graphs unavoidable on planar graphs. Theorem 1. Every outerplanar graph is unavoidable on planar graphs. However, we show that there exists an infinite family of planar but not outerplanar graphs which are unavoidable on planar graphs. Let θ i,j,k denote the union of three internally disjoint paths of lengths i, j, k, respectively. Theorem 2. The graph θ 2,j,k is unavoidable for even j, k. The paper is organized as follows. In Section 2, we introduce notation. Section 3 gives a proof of Theorem 1, and Section 4 gives a proof of Theorem 2. 2 Notation In this section, we first mention several notions that are particularly important for the next discussion. Besides these, we follow standard graph theory terminology (see Diestel [4]). the electronic journal of combinatorics 21(1) (2014), #P1.64 2

3 : X 1 X 3 H : X 2 Figure 1: raphs and H such that H. All graphs considered here are simple and undirected. For a graph, the set of vertices is denoted by V () and the set of edges by E(). The length of a path is the number of its edges. If we replace an edge e of with a path of length k + 1 (i.e. we place k vertices of degree 2 on e), then we say that e is subdivided k-times. For a fixed graph, a copy H of is a graph isomorphic to with V () V (H) =. For two graphs 1 = (V 1, E 1 ) and 2 = (V 2, E 2 ), their union is the graph 1 2 = (V 1 V 2, E 1 E 2 ). When we say that a graph is a disjoint union of 1 and 2, we are automatically assuming that V 1 V 2 =. A planar graph is a graph that can be drawn in the plane without edge crossings. An outerplanar graph is a planar graph that can be embedded so that all its vertices belong to the boundary of the outer face. A red-blue graph is a graph with its edges colored red or blue. A red-blue graph will often use the same name as its underlying (uncolored) graph. Let 1 and 2 be two disjoint graphs containing cliques H 1, H 2 (H i i ) of size k 0. Let the vertices of H i be labeled v 1 ( i ),..., v k ( i ). A k-sum 1 k 2 of 1 and 2 is a graph formed from the disjoint union of 1 and 2 by identifying the vertex v j ( 1 ) with v j ( 2 ) for each j = 1,..., k. To simply notation, we write 1 2 if k 2. Note that 1 2 does not specify the appending cliques, and so it is not a well-defined operation. However, if k = 1, then we can make this notation precise and specify the appending vertex v by writing 1 v 2 (which we will do often). For k = 2, we sometimes write 1 e 2, where e( i ) is a non-oriented edge v 1 ( i )v 2 ( i ) (the resulting graph is again not always unique). Also, we abbreviate (( 1 2 )... ) n by 1 2 n. Let be a graph, H a subgraph of. If there exist planar graphs X 1,..., X n such that = H X 1 X n, then we say that is reducible to H, and we write H. It is a well known fact that for k 2, a k-sum of two planar graphs is planar, thus the following holds: Remark 3. If H is a planar graph, and a graph is reducible to H, then is planar. Informally, is reducible to H if can be formed from H by successively appending planar graphs on edges/vertices. So, Remark 3 says that if the starting graph H is planar, then so is. Consider an online Ramsey game on planar graph. A strategy (for Builder) X is a finite sequence of rules that tell Builder how to move on any given turn of the game, no matter how Painter plays. If a monochromatic copy of the target graph arises, the electronic journal of combinatorics 21(1) (2014), #P1.64 3

4 the game ends and Builder wins (provided that the final red-blue graph is planar). The output graph of strategy X is then the final red-blue graph with a fixed monochromatic copy of, called a winning copy (of by X) and denoted simply by if no confusion can arise. This winning copy adopts all notation from the target graph. For example, for a target graph with vertices u, v and a cycle C, the two corresponding vertices and the corresponding cycle are again denoted by u, v, C in the chosen winning copy. If Builder always wins when following strategy X, then we say that is unavoidable by strategy X. The set of all output graphs of a strategy X is denoted X (the calligraphic version of the name of the strategy). 3 Outerplanar graphs In this section we show that every outerplanar graph is unavoidable on the class of planar graphs. The idea behind our proof is based on the inductive proof of the self-unavoidability of forests presented by rytczuk et al. [5]. Suppose that Builder s goal is to force a forest T. We can assume that T is a tree (since every forest is contained in some tree). Choose a leaf u of T, let v be the neighbor of u in T, and let T = T u. Builder forces 2 T 1 monochromatic copies of T (where the corresponding final graphs are pairwise disjoint), from which at least T are of the same color, say blue. On those copies, Builder builds a new copy of T by adding edges between copies of v. If any one of the new added edges is blue, then that edge and a blue copy of T appended to one of its endpoints form a blue copy of T. Otherwise, those edges form a red copy of T. We will call this strategy the tree strategy. Since trees are planar, the tree strategy shows that forests are unavoidable (on planar graphs). Moreover, a generalized version of the tree strategy can be used for forcing a graph formed from a tree T by appending a copy of an unavoidable graph to each vertex of T. Before presenting this strategy we need some notation. Let T be a tree on vertices v 1 (T ),..., v n (T ), and let be a graph with an arbitrary vertex labeled by v. The ordered triple (T,, v) denotes the graph T v1 1 v2 vn n, where for i = 1,..., n, i is a copy of and v i ( i ) V ( i ) is the copy of v. We refer to the identified vertices v i (T ) = v i () in (T,, v) by v i. Next, let S be any set of red-blue graphs X such that each has a fixed monochromatic copy X of. Let A be a red-blue graph with a fixed monochromatic subgraph (T,, v) = T v1 1 v2 vn n. We say that A is (T, S)-reducible if A T v1 X 1 v2 vn X n, where for each i [n] either X i is a monochromatic copy of, or X i S such that i = Xi. In our proofs we take S to be the set of all final graphs of some strategy. For example, the set of all output graphs X of a strategy X is a set of red-blue graphs, each with a fixed monochromatic copy of, and so, for any given tree T, we can talk about (T, X )-reducible graphs. Suppose that is unavoidable by strategy X. We consider the following Builder s strategy for forcing a monochromatic copy of (T,, v). the electronic journal of combinatorics 21(1) (2014), #P1.64 4

5 X i X j (T,, v) : i e ij j (T,, v) T T u i e ij u j (T,, v) Figure 2: Forcing a monochromatic copy of (T,, v), where T is a path of length 2, a triangle, and v is an arbitrary vertex of V (). strategy A (T,, v, X) Let n = V (T ), k = V ((T,, v)). 1. If n = 1, call strategy X and stop. 2. If n > 1, choose a leaf u of T, set T = T u, and call strategy A(T,, v, X) (2k 1)-times. Choose k copies H 1,..., H k of (T,, v) of the same color, and in ith of them label the vertex that corresponds to the neighbor of u in T by u i. Add an edge e ij = u i u j if and only if v i v j is an edge in (T,, v). To prove that (T,, v) is unavoidable by strategy A(T,, v, X), we have to ensure that no matter how Painter plays, a monochromatic copy of the target graph (T,, v) eventually appears, and that the final graph is planar. Both parts are shown below using induction and reduction arguments that rely on Remark 3. Lemma 4. Let T be a tree, a graph, and v a vertex of V (). If is unavoidable by strategy X, then (T,, v) is unavoidable by strategy A(T,, v, X), and every graph A of A(T,, v, X) is (T, X )-reducible. Proof. We use all the notation introduced in strategy A. The proof is by induction on the number n of vertices of T. If n = 1, then (T,, v) =, which is unavoidable by strategy X by the assumption. Since A(T,, v, X) = X, the graph A is (T, X )-reducible. Now let n > 1. The following two cases can arise. Case 1: All edges e ij are red. These edges form a red (T,, v). Every final graph for forcing H i is planar by the induction hypothesis. Observe that each such graph is appended to (T,, v) by one vertex only. Thus, A is reducible directly to (T,, v), and hence is (T, X )-reducible, which proves the planarity as well as the second part of the claim. See Figure 2. Case 2: Some edge e ij is blue. The graph H i, the edge e ij, and one copy of contained in H j form a blue (T,, v). The graph A is planar by previous discussion, so the first part of the claim is complete. Let A i, A j A(T,, v, X) be subgraphs of A that were used for forcing H i and H j, respectively. By the induction hypothesis, A i is (T, X )-reducible. the electronic journal of combinatorics 21(1) (2014), #P1.64 5

6 : B() : B 1 B 3 B 4 B 1 B 3 B 4 B 2 B 2 Figure 3: A graph and its complete block graph B(). Similarly A j is (T, X )-reducible, and therefore is (u, X )-reducible. Since the rest of A is reducible to e ij, and e ij shares with each of H i and H j only one vertex (the vertex u i and u j, respectively), we get the second part of the claim. A block is a maximal 2-connected subgraph. For a graph with a vertex set V = {v 1,..., v k } and blocks B 1,..., B l, the complete block graph B() is a graph on V {B 1,..., B l } formed by the edges v i B j with v i V (B j ) (see Figure 3). Notice that B() can be obtained from the block graph B() of by adding edges with one endpoint of degree 1, and thus, B() is a tree for every connected graph. Remark 5. The union of an outerplanar graph and its complete block graph B() is planar. Let H be an outerplanar graph. The weak dual H of H is the graph obtained from the plane dual of H by removing the vertex that corresponds to the outer face of H. It is easy to see that H is a forest, which is a tree whenever H is 2-connected. If there exists a vertex r V (H ) such that H rooted in r (denoted by H (r)) is a full binary tree, then we call H a full outerplanar graph. The height h(h) of a full outerplanar graph H is the number of levels in its full binary tree H (r). The edge of a full outerplanar graph H incident to the face that corresponds to r, as well as to the the outer face, is the central edge e H of H (see Figure 4, left). For the sake of convenience, a graph that consists of a single edge is also considered to be full outerplanar. Its height is then defined to be 0 and its central edge is the only edge of the graph. Lemma 6. For every outerplanar graph there exists a full outerplanar graph H such that H. Proof. Let T be an almost triangulation of, i.e. an outerplanar graph formed by triangulating the inner faces of. The maximum degree of T is at most 3, and there exists a vertex r V ( T ) of degree 1 or 2. Let H (r) be a full binary tree of height h( T (r)) containing T. The graph H is then the desired full outerplanar graph. Recall that for a tree T with n vertices and m edges, a graph, and a vertex v V (), we have (T,, v) = T v1 1 v2 vn n. Let H be a full outerplanar graph, and the electronic journal of combinatorics 21(1) (2014), #P1.64 6

7 H : e r (T,, v, H) : H e v T H H H H Figure 4: A full outerplanar graph H with its full binary tree H (r) of height 3 (left). The structure of (T,, v, h) (right). for i = 1,..., m, let H i be a copy of H with the central edge e i (H i ). Then we define (T,, v, H) as a graph T v1 1 v2 vn n e1 H 1 e2 em H m. So, (T,, v, H) is simply the graph that arises from (T,, v) if we glue a copy of H by its central edge to every edge of T (cf. Figure 4, right). We now present a strategy B for forcing a monochromatic copy of (T,, v, H), assuming that is unavoidable by a strategy X. strategy B (T,, v, H, X) Let t = V (T ) and h = h(h). 1. If t = 1, call strategy X and stop. 2. If h = 0, call strategy A(T,, v, X) and stop. 3. Choose a leaf u of T and call its neighbor u. Call strategy B(T,, v, H, X ), where T = B(T,, v, H), = (T u,, v, H), v is the vertex of T u that corresponds to u, H is the full outerplanar graph of height h 1, X = B(T u,, v, H, X). Let {u 1,..., u k } be the vertex set of (T,, v, H), and thus also a subset of a vertex set of B(T,, v, H) = T. Adopt this notation to the subgraph T of the winning copy (T,, v, H ) found by strategy B(T,, v, H, X ). Add an edge e ij = u i u j in (T,, v, H ) if and only if u i u j is an edge in (T,, v, H). Let S be a set of red-blue graphs such that each X S contains a fixed monochromatic graph. Then we set S = S { B()}, where is the fixed monochromatic graph. Theorem 1. Every outerplanar graph is unavoidable (on planar graphs). the electronic journal of combinatorics 21(1) (2014), #P1.64 7

8 (T,, v, H) : T X j H H X i i e ij j u j u i Figure 5: Forcing a monochromatic copy of (T,, v, H), where T is a path of length 2, is a cycle of length 4, v is any vertex of V (), and H is the full outerplanar graph of height 1. Proof. We prove a stronger claim instead. Claim. Let T be a tree, an outerplanar graph, and v V (). If is unavoidable by strategy X, then (T,, v, H) is unavoidable by strategy B(T,, v, H, X), and every graph B B(T,, v, H, X) is (T, X )-reducible. This statement implies Theorem 1 since every outerplanar graph is contained in some full outerplanar graph H by Lemma 6, which can be written as (e H, ({v}, ), v, H), and is therefore unavoidable by the above claim. We adopt all the notation used in strategy B. Let S be the set of all 2-tuples (h, t) (N {0}) N. On S, we define the lexicographic order, i.e. (h 1, t 1 ) (h 2, t 2 ) exactly when h 1 < h 2, or h 1 = h 2 and t 1 t 2 for all h 1, h 2 N {0} and t 1, t 2 N. The set S together with the relation is linear, and we can apply induction. We start with the basis. Suppose first that h 0, and t = 1. Then (T,, v, H) = and the claim is trivially satisfied. Let now h = 0, and t 1. In this case we have (T,, v, H) = (T,, v). By Lemma 4, (T,, v) is unavoidable by A(T,, v, X). So, every graph of A(T,, v, X) is (T, X )-reducible, and thus (T, X )-reducible since X X. Suppose now that h 1, t 2. By the induction hypothesis ((h, t 1) (h, t)), = (T u,, v, H) is unavoidable by strategy X = B(T u,, v, H, X), and every graph of X is (T u, X )-reducible. Since is unavoidable by strategy X, it holds by the induction hypothesis ((h 1, t) (h, t)) that (T,, v, H ) is unavoidable by strategy B = B(T,, v, H, X ), and every graph B of B is (T, X )-reducible. Say that the winning copy (T,, v, H ) in B is blue. We distinguish the following two cases: Case 1: All edges e ij are red. These edges form a red copy of (T,, v, H). The graph B is (T, X )-reducible, and thus reducible to T = B(T,, v, H). Since B arose from B by adding the edges forming (T,, v, H), B is reducible to (T, B(), v), and thus (T, X )-reducible. the electronic journal of combinatorics 21(1) (2014), #P1.64 8

9 Case 2: At least one edge e ij = u i u j is blue. The endpoints of e ij are connected by a path P in T of length 2. There is a copy of H appended along each of the edges of P. Those two copies of H together with e ij form a full outerplanar graph H of height h with central edge e ij (see Figure 5). Let i and j be the blue copies of = (T u,, v, H) appended to u i and u j, respectively. Then H, i, and the copy of in j that is appended to u j form a blue copy of (T,, v, H). We can assume that Builder chooses this copy as the winning copy. We now prove the second part of the claim. Recall that B is (T, X )-reducible. Let X i, X j be the graphs of X appended to u i, u j, respectively. So, X i is (T u, X )-reducible, and X j is ({u j }, X )-reducible. Since the rest of the graph B is reducible to e ij, we find that B is (T, X )-reducible. See the diagram on the right in Figure 5. 4 Non-outerplanar graphs We now show that an infinite subclass of theta-graphs is unavoidable on planar graphs. Recall that a theta-graph (θ-graph) is the union of three internally disjoint paths that have the same two end vertices. We write θ i,j,k for the theta-graph with paths of length i, j, k. For example, K 2,3 is the graph θ 2,2,2. Before stating the main theorem, we introduce a strategy for forcing even cycles. The unavoidability of cycles was proven in [5], but here we need the final graph to have a special type of plane embedding that we utilize in the proof of the main theorem. Let C be a cycle of even length n that is unavoidable by strategy X. If for every graph X of X there is a plane embedding of X such that (1) all vertices of V (C) belong to the boundary of one common face, and (2) there exists a path P C of length n 2 of another face, such that all vertices of V (P ) lie the boundary then we say that strategy X is a good strategy. The path P is then called a good path in C. strategy C (C) Let n = V (C), a = (n 1), and b = n Force a monochromatic path P = v 0... v a 2 +b by the tree strategy. 2. In P, Connect the vertices v 0 and v a 2 by an edge e. 3. If e has the other color than P, add the path P = v 0 v a v 2a... v a 2. Otherwise add the cycle C = v b v (b+a) v (b+2a)... v (b+a 2 )v b. Lemma 7. Let C be an even cycle. Then strategy C(C) is a good strategy. the electronic journal of combinatorics 21(1) (2014), #P1.64 9

10 e f e v 0 v 10 v0 v 10 e 0 e 1 e 2 f Figure 6: Forcing cycle of length 4 by strategy C. Proof. We will follow the notation introduced in strategy C. We fix a planar embedding of an output graph of strategy C(C) as shown in Figure 6. By [5], every final graph of the tree strategy for forcing P is a forest, which is reducible to (the chosen monochromatic) P. Assume that P is blue. The following two cases can arise. Case 1: The edge e is red. If Painter colors some edge of P blue, a blue copy of C arises since there is a blue path of length n 1 between such two vertices. Otherwise, P e is a red cycle C of length n. In both cases, all vertices of the monochromatic copy of C belong to two common faces. See Figure 6, left. Case 2: The edge e is blue. Suppose that Painter colors some edge e of C v b v (a 2 +b) blue. Since each such pair is connected by a blue path of length a = n 1, a blue cycle of length n arises. Condition (1) is then satisfied by the face bounded by this cycle, and (2) is satisfied by the face f bounded by the cycle v 0 v a v 2a... v a 2v 0, which contains a good path on n/2 + 1 vertices if e = v a(a 1) v a 2 and on all n vertices in all the other cases. Suppose now that Painter colors the edge v b v (a 2 +b) blue. Then the blue copy of C is formed by this edge and the blue path starting at v b, going through e, and ending at v (a 2 +b). All of the vertices of the blue copy of C belong to the outer face, and there is a good path v b v b 1... v 0 v a 2 of length b + 1 = n that belongs to f. Consider the last 2 possibility when C is red. Now, all of the vertices of V (C) belong to the boundary of f, and all but the vertex v (a 2 +b) of V (C) belong to the boundary of f. See Figure 6, right. Theorem 2. The graph θ 2,j,k is unavoidable for even j, k. Proof. For fixed j and k, let j = j 2, k = k 2. We consider disjoint cycles C 1,..., C j +k +1 of length k + 2. In ith of them, we label an arbitrary vertex by c i and one of the two vertices in distance 2 from c i by v 0 (C i ) if i j + 1, and by v 1 (C i ) otherwise. Let P 1,..., P j +k +2 be paths of length j 1, where in each P i, one end is labeled by p i, and another one by v 0 (P i ) if i j + 1, and by v 1 (P i ) otherwise. Let and L := C 1 v0 v0 C j +1 v0 P 1 v0 v0 P j +1 R := C j +2 v1 v1 C j +k +1 v1 P j +2 v1 v1 P j +k +2. Then we write H for a graph that is formed from the disjoint union of L and R by identifying p 1 with p j +k +2, and p j +1 with p j +2 (see Figure 7, left). The cycle consisting of the paths P 1, P j +1, P j +2, and P j +k +2 is denoted C 0. the electronic journal of combinatorics 21(1) (2014), #P

11 H: θ 2,2,4 : p 1 = p 5 p 1 = p 5 P 1 P 5 c 4 c 4 c 2 C 0 C 4 v 0 C 2 C 1 c v P C 3 p 4 c 2 c 1 p 4 P 2 P 3 c 3 c 3 p 2 = p 3 p 2 = p 3 Figure 7: raph H for j = 2, k = 4 (left) and forcing θ 2,2,4 using H (right). Observe first that having a monochromatic copy of a H, Builder could easily force θ 2,j,k (cf. Figure 7). The graph H is outerplanar, and hence unavoidable by Theorem 1. The problem is that by connecting the proper vertices of the monochromatic copy of H in the resulting graph, the planarity condition would be violated. Therefore, we have to change the strategy for forcing H. For n = 0,..., j + k + 1, let n := H[V (C 0 C n )]. So, the graph j +k +1 is the graph H without the paths P 2,..., P j, P j +3,..., P j +k +1. Let us refer to the blocks of n and the corresponding vertices of the complete block graph simply by C 0, C 1,..., C n. Next, let V be the set of vertices of n (and thus also of B( n )) for which the distance from v 0 in n is even. For n, we define a subdivided complete block graph B S ( n ) as a graph that arises from B( n ) by subdividing each edge joining C i (i = 1,..., n) and a vertex of V (k 1)-times. Observe that B S () is a tree, and that B S () is planar. We now present strategy D for forcing n. strategy D ( n ) 1. If n = 0, call strategy C(C 0 ). In C 0, find a good path P 0, denote the middle vertex of P 0 by v 0 and its opposite vertex in C 0 by v If n 1, let T = B S ( n ), = n 1, v = v 0 if n j + 1 and v = v 1 otherwise, and D = D( n 1 ). Call strategy A(T,, v, D ). 3. In (T,, v ), connect two vertices of T = B S ( n ) by an edge if and only if the corresponding vertices are connected by an edge in n. We show by induction on n that n is unavoidable by strategy D( n ), and that every graph D of D( n ) can be embedded in the plane so that (1) all vertices v 0, v 1, p 1, p j +1, c 1,..., c n belong to some face f 1, and (2) (a) the vertices v 0, p 1, p j +1 belong to some face f 2, other than f 1, or (b) there is a path P = p 1 c 1 p j +1 of the other color than n. the electronic journal of combinatorics 21(1) (2014), #P

12 C 1 C C 3 C 3 C 2 B S ( 3 ) Figure 8: Left: The graphs 3 (dashed) and B S ( 3 ) (solid) for j = 2, k = 2. Black vertices represent the vertices of B( 3 ) whereas white ones are the subdividing vertices. Right: Forcing 3, Case 2 one of the edges added to (T,, v ) = (B S ( 3 ), 2, v 2 ) is blue. The base case is n = 0. By Lemma 7, strategy C(C 0 ) is a good strategy, i.e. every graph of C(C 0 ) can be embedded in such a way that all vertices of C 0 belong to one common face, and there is a path P 0 C 0 of length 4(j 1) = 2(j 1) such that all vertices 2 of V (P 0 ) belong to the boundary of another face. The first part implies condition (1), and the second part implies condition (2)(a). Now assume that n 1. We first show that D is planar. Every graph of D( ) is planar by induction. Therefore, every graph A of A(T,, v, D ) is reducible to T by Lemma 4, and thus planar. Since T = B s ( n ), every graph that arises in Step 3 of strategy D( n ) is reducible to B s ( n ) n, which is planar. Let us prove that a monochromatic copy of n arises when following strategy D( n ), and that D fulfills Conditions (1) and (2). Suppose that the monochromatic copy of (T,, v ) in A is blue. Let us focus on the edges added in Step 3. The following two cases can arise. Case 1: All these edges are red. Since all the edges form a copy of n, we get a red n. According to the discussion above, D is reducible to B s ( n ) n. Every B s (C i ) (i = 0,..., n) can be drawn inside the cycle C i of n. Then, all the vertices of n belong to the boundary of the outer face, which gives us Condition (1). Condition (2) is also satisfied as there is a blue path p 1 C 0 p j +1. Case 2: At least one edge e is blue. The edge e joins the ends of a blue path P of length k + 1 of T. So, a cycle C n of length k + 2 is formed. Since there is a copy of = n 1 appended to each vertex of T and n = n 1 C n, k + 2 blue copies of n are formed. Builder arbitrarily chooses one of them, called n. The graph A of A(T,, v, D ) is (T, D )-reducible by Lemma 4. Since P T, the graph A is (P, D )- reducible. Let D be the graph of D that contains the copy of n 1 in the chosen blue graph n. By the induction hypothesis, D can be embedded so that Conditions (1) and (2) are satisfied (for n 1 in D ). Therefore, the graph D can be embedded is such a way that all the vertices v 0, v 1, p 1, p j +1, c 1,..., c n 1 of lie in the boundary of a common the electronic journal of combinatorics 21(1) (2014), #P

13 p 1 p 1 c 4 c 1 c 4 c 2 C 1 C 0 C 4 C 4 C P 4 c 2 2 p P 4 p 4 4 x c 1 C 2 C 1 C 0 C3 C 3 c 3 c 3 p 2 p 2 Figure 9: Adding edges of a copy of θ 2,2,4 to H if the condition (2)a (left), resp. (2)b (right) is satisfied. face and either v 0, p 1, p j +1 belong to another common face or there is red path of p 1 c 1 p j +1. Also, D can be embedded so that all vertices of C n lie in the boundary of a common face. Now, can be drawn inside that face, which gives both Condition (1) and Condition (2). Having a monochromatic copy of = j +k +1, Builder can force H = v0 T 0 v1 T 1, where T 0 = P 2 v0 v0 P j and T 1 = P j +3 v1 v1 P j +k +1. Indeed, since is unavoidable by strategy D( j +k +1), the supergraph (T 0,, v 0 ) of v0 T 0 is unavoidable by strategy X = A(T 0,, v 0, D()) by Lemma 4. Applying Lemma 4 again, we find that the supergraph (T 1, (T 0,, v 0 ), v 1 ) of v0 T 0 v1 T 1 is unavoidable by strategy A(T 1, (T 0,, v 0 ), v 1, X). In order to force θ 2,j,k, it suffices to add the appropriate edges to v0 T 0 v1 T 1. The whole process is summed up in strategy E. strategy E (θ 2,j,k ) 1. Call strategy A(T 1, (T 0,, v 0 ), v 1, X), where X = A(T 0,, v 0, D()) and v 1 is an arbitrary vertex corresponding to v 1 of some copy of in (T 0,, v 0 ). Chose a monochromatic copy of H. 2. Add edges of the cycle p 1 c 2 p 2 c 3... p j +1(= p j +2)c j +2p j c j +k +1p 1 to H. If there is not the path p 1 c 1 p j +1, also add the edges p 1 c 1 and c 1 p j +1. As a consequence of Lemma 4, every graph of A(T 1, (T 0,, v 0 ), v 1, X) can be embedded in such a way that Conditions (1) and (2) hold for, and that all the vertices p 2,..., p j +k +1 lie in the boundary of the face f 1. This means that adding the cycle in Step 3 of strategy E does not violate the planarity of the final graph. Finally, Condition (2) ensures that either there already is a path of length 2 connecting p 1 and p j +1 of the desired color, or Builder can add it by connecting p 1 to c 1 and c 1 to p j +1. the electronic journal of combinatorics 21(1) (2014), #P

14 5 Further problems The question of whether the class of planar graphs is self-unavoidable is still open. To disprove it, it suffices to find a single planar graph such that Painter can ensure that a monochromatic copy of never occurs when playing on planar graphs. The graph K 4 seems to be a good candidate. Conjecture 8. K 4 is avoidable on the class of planar graphs. Unfortunately, Painter s winning strategies seem to be much harder to find. So far, only one such strategy has been presented; namely a strategy showing that a triangle is avoidable on the class of outerplanar graphs given in [5]. Acknowledgements The author would like to thank to Tomáš Kaiser for suggesting this problem and for his subsequent guidance. Without his help, this paper would never have been completed. References [1] J. Beck. On size Ramsey number of paths, trees and cycles I. J. raph Theory, 7: , [2] J. Butterfield, T. rauman, W. B. Kinnersley, K.. Milans, C. Stocker, D. B. West. On-line Ramsey Theory for Bounded Degree raphs. Electron. J. Comb., 18(11):P136, [3] D. Conlon. On-line Ramsey numbers. SIAM J. Discrete Math., 23: , [4] R. Diestel. raph Theory. Springer-Verlag, [5] J. A. rytczuk, M. Ha luszczak, H. A. Kierstead. On-line Ramsey Theory. Electron. J. Combin., 11(1):R57, [6] J. A. rytczuk, H. A. Kierstead, P. Pra lat. On-line Ramsey Numbers for Paths and Stars. Discrete Math. Theor. Comp. Science, 10(3):63 74, [7] P. E. Haxell, Y. Kohayakawa, and T. Luczak. The induced size-ramsey number of cycles. Combin. Probab. Comput., 4: , [8] H. A. Kierstead,. Konjevod. Coloring number and on-line Ramsey theory for graphs and hypergraphs. Combinatorica, 29(1):49 64, [9] A. Kurek, A. Ruciński, Two variants of the size Ramsey number, Discuss. Math. raph Theory, 25(1 2): , the electronic journal of combinatorics 21(1) (2014), #P

### A NOTE ON OFF-DIAGONAL SMALL ON-LINE RAMSEY NUMBERS FOR PATHS

A NOTE ON OFF-DIAGONAL SMALL ON-LINE RAMSEY NUMBERS FOR PATHS PAWE L PRA LAT Abstract. In this note we consider the on-line Ramsey numbers R(P n, P m ) for paths. Using a high performance computing clusters,

### On-line Ramsey Theory for Bounded Degree Graphs

On-line Ramsey Theory for Bounded Degree Graphs Jane Butterfield Tracy Grauman William B. Kinnersley Kevin G. Milans Christopher Stocker Douglas B. West University of Illinois Urbana IL, U.S.A. Submitted:

### On-line Ramsey numbers

On-line Ramsey numbers David Conlon Abstract Consider the following game between two players, Builder and Painter Builder draws edges one at a time and Painter colours them, in either red or blue, as each

### 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

### 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

### 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

### 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

### INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

### 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

### 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].

### On-line Ramsey Numbers of Paths and Cycles

On-line Ramsey Numbers of Paths and Cycles Joanna Cyman Department of Technical Physics and Applied Mathematics, Gdańsk University of Technology, Narutowicza 11/1, 80-9 Gdańsk, Poland joana@mif.pg.gda.pl

### 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

### 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

### Graphs without proper subgraphs of minimum degree 3 and short cycles

Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract

### On an anti-ramsey type result

On an anti-ramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider anti-ramsey type results. For a given coloring of the k-element subsets of an n-element set X, where two k-element

### Graph Theory Problems and Solutions

raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is

### 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

### CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected

### 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

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 11

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note Conditional Probability A pharmaceutical company is marketing a new test for a certain medical condition. According

### 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

### Markov random fields and Gibbs measures

Chapter Markov random fields and Gibbs measures 1. Conditional independence Suppose X i is a random element of (X i, B i ), for i = 1, 2, 3, with all X i defined on the same probability space (.F, P).

### Removing Even Crossings

EuroComb 2005 DMTCS proc. AE, 2005, 105 110 Removing Even Crossings Michael J. Pelsmajer 1, Marcus Schaefer 2 and Daniel Štefankovič 2 1 Department of Applied Mathematics, Illinois Institute of Technology,

### Lecture 17 : Equivalence and Order Relations DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion

### 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

### The minimum number of distinct areas of triangles determined by a set of n points in the plane

The minimum number of distinct areas of triangles determined by a set of n points in the plane Rom Pinchasi Israel Institute of Technology, Technion 1 August 6, 007 Abstract We prove a conjecture of Erdős,

### 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

### princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora Scribe: One of the running themes in this course is the notion of

### Strong Ramsey Games: Drawing on an infinite board

Strong Ramsey Games: Drawing on an infinite board Dan Hefetz Christopher Kusch Lothar Narins Alexey Pokrovskiy Clément Requilé Amir Sarid arxiv:1605.05443v2 [math.co] 25 May 2016 May 26, 2016 Abstract

### On the k-path cover problem for cacti

On the k-path cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we

### Ramsey numbers for bipartite graphs with small bandwidth

Ramsey numbers for bipartite graphs with small bandwidth Guilherme O. Mota 1,, Gábor N. Sárközy 2,, Mathias Schacht 3,, and Anusch Taraz 4, 1 Instituto de Matemática e Estatística, Universidade de São

### An algorithmic classification of open surfaces

An algorithmic classification of open surfaces Sylvain Maillot January 8, 2013 Abstract We propose a formulation for the homeomorphism problem for open n-dimensional manifolds and use the Kerekjarto classification

### Tree-representation of set families and applications to combinatorial decompositions

Tree-representation of set families and applications to combinatorial decompositions Binh-Minh Bui-Xuan a, Michel Habib b Michaël Rao c a Department of Informatics, University of Bergen, Norway. buixuan@ii.uib.no

### On end degrees and infinite cycles in locally finite graphs

On end degrees and infinite cycles in locally finite graphs Henning Bruhn Maya Stein Abstract We introduce a natural extension of the vertex degree to ends. For the cycle space C(G) as proposed by Diestel

### 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

### 6.3 Conditional Probability and Independence

222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted

### 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

### 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

### The degree, size and chromatic index of a uniform hypergraph

The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the

### 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

### Triangle deletion. Ernie Croot. February 3, 2010

Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,

### arxiv: v2 [math.co] 30 Nov 2015

PLANAR GRAPH IS ON FIRE PRZEMYSŁAW GORDINOWICZ arxiv:1311.1158v [math.co] 30 Nov 015 Abstract. Let G be any connected graph on n vertices, n. Let k be any positive integer. Suppose that a fire breaks out

### Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

### arxiv:1203.1525v1 [math.co] 7 Mar 2012

Constructing subset partition graphs with strong adjacency and end-point count properties Nicolai Hähnle haehnle@math.tu-berlin.de arxiv:1203.1525v1 [math.co] 7 Mar 2012 March 8, 2012 Abstract Kim defined

### Generating models of a matched formula with a polynomial delay

Generating models of a matched formula with a polynomial delay Petr Savicky Institute of Computer Science, Academy of Sciences of Czech Republic, Pod Vodárenskou Věží 2, 182 07 Praha 8, Czech Republic

### 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

### Homework Exam 1, Geometric Algorithms, 2016

Homework Exam 1, Geometric Algorithms, 2016 1. (3 points) Let P be a convex polyhedron in 3-dimensional space. The boundary of P is represented as a DCEL, storing the incidence relationships between the

### 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

### 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

### 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:

### The Open University s repository of research publications and other research outputs

Open Research Online The Open University s repository of research publications and other research outputs The degree-diameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:

### Mathematical Induction

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### 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

### 1 Definitions. Supplementary Material for: Digraphs. Concept graphs

Supplementary Material for: van Rooij, I., Evans, P., Müller, M., Gedge, J. & Wareham, T. (2008). Identifying Sources of Intractability in Cognitive Models: An Illustration using Analogical Structure Mapping.

### Clique coloring B 1 -EPG graphs

Clique coloring B 1 -EPG graphs Flavia Bonomo a,c, María Pía Mazzoleni b,c, and Maya Stein d a Departamento de Computación, FCEN-UBA, Buenos Aires, Argentina. b Departamento de Matemática, FCE-UNLP, La

### Regular Languages and Finite Automata

Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a

### 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

### Reading 13 : Finite State Automata and Regular Expressions

CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model

### On planar regular graphs degree three without Hamiltonian cycles 1

On planar regular graphs degree three without Hamiltonian cycles 1 E. Grinbergs Computing Centre of Latvian State University Abstract. Necessary condition to have Hamiltonian cycle in planar graph is given.

### SOLUTIONS TO ASSIGNMENT 1 MATH 576

SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts

### most 4 Mirka Miller 1,2, Guillermo Pineda-Villavicencio 3, The University of Newcastle Callaghan, NSW 2308, Australia University of West Bohemia

Complete catalogue of graphs of maimum degree 3 and defect at most 4 Mirka Miller 1,2, Guillermo Pineda-Villavicencio 3, 1 School of Electrical Engineering and Computer Science The University of Newcastle

### Euclidean Geometry. We start with the idea of an axiomatic system. An axiomatic system has four parts:

Euclidean Geometry Students are often so challenged by the details of Euclidean geometry that they miss the rich structure of the subject. We give an overview of a piece of this structure below. We start

### Online Degree Ramsey Theory

UofL Discrete Math Workshop 2008 1 Online Degree Ramsey Theory posed by Illinois REGS (2007) problem 1 presented by Lesley Wiglesworth LATEX byadamjobson For a family of graphs F closed under subgraphs,

### 5.3 The Cross Product in R 3

53 The Cross Product in R 3 Definition 531 Let u = [u 1, u 2, u 3 ] and v = [v 1, v 2, v 3 ] Then the vector given by [u 2 v 3 u 3 v 2, u 3 v 1 u 1 v 3, u 1 v 2 u 2 v 1 ] is called the cross product (or

### High degree graphs contain large-star factors

High degree graphs contain large-star factors Dedicated to László Lovász, for his 60th birthday Noga Alon Nicholas Wormald Abstract We show that any finite simple graph with minimum degree d contains a

### 1 Introduction to Counting

1 Introduction to Counting 1.1 Introduction In this chapter you will learn the fundamentals of enumerative combinatorics, the branch of mathematics concerned with counting. While enumeration problems can

### INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem

### Full and Complete Binary Trees

Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full

### 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,

### IMO Training 2010 Russian-style Problems Alexander Remorov

Solutions: Combinatorial Geometry 1. No. Call a lattice point even if the sum of its coordinates is even, and call it odd otherwise. Call one of the legs first, and other one second. Then every time a

### 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

### 1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

### Stationary random graphs on Z with prescribed iid degrees and finite mean connections

Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative

### R u t c o r Research R e p o r t. Boolean functions with a simple certificate for CNF complexity. Ondřej Čepeka Petr Kučera b Petr Savický c

R u t c o r Research R e p o r t Boolean functions with a simple certificate for CNF complexity Ondřej Čepeka Petr Kučera b Petr Savický c RRR 2-2010, January 24, 2010 RUTCOR Rutgers Center for Operations

### Catalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni- versity.

7 Catalan Numbers Thomas A. Dowling, Department of Mathematics, Ohio State Uni- Author: versity. Prerequisites: The prerequisites for this chapter are recursive definitions, basic counting principles,

### On Pebbling Graphs by their Blocks

On Pebbling Graphs by their Blocks Dawn Curtis, Taylor Hines, Glenn Hurlbert, Tatiana Moyer Department of Mathematics and Statistics Arizona State University, Tempe, AZ 85287-1804 November 19, 2008 dawn.curtis@asu.edu

### 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

### GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the

### Finding and counting given length cycles

Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected

### Math212a1010 Lebesgue measure.

Math212a1010 Lebesgue measure. October 19, 2010 Today s lecture will be devoted to Lebesgue measure, a creation of Henri Lebesgue, in his thesis, one of the most famous theses in the history of mathematics.

### Analysis of Algorithms, I

Analysis of Algorithms, I CSOR W4231.002 Eleni Drinea Computer Science Department Columbia University Thursday, February 26, 2015 Outline 1 Recap 2 Representing graphs 3 Breadth-first search (BFS) 4 Applications

### Shortcut sets for plane Euclidean networks (Extended abstract) 1

Shortcut sets for plane Euclidean networks (Extended abstract) 1 J. Cáceres a D. Garijo b A. González b A. Márquez b M. L. Puertas a P. Ribeiro c a Departamento de Matemáticas, Universidad de Almería,

### About the inverse football pool problem for 9 games 1

Seventh International Workshop on Optimal Codes and Related Topics September 6-1, 013, Albena, Bulgaria pp. 15-133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute

### 3. Equivalence Relations. Discussion

3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,

### The Graphical Method: An Example

The Graphical Method: An Example Consider the following linear program: Maximize 4x 1 +3x 2 Subject to: 2x 1 +3x 2 6 (1) 3x 1 +2x 2 3 (2) 2x 2 5 (3) 2x 1 +x 2 4 (4) x 1, x 2 0, where, for ease of reference,

### POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

### arxiv:1409.4299v1 [cs.cg] 15 Sep 2014

Planar Embeddings with Small and Uniform Faces Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl 3, and Ignaz Rutter 3,4 arxiv:409.499v [cs.cg] 5 Sep 04 Department of Engineering, Roma Tre University, Italy

### 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.,

### A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do

### Formal Languages and Automata Theory - Regular Expressions and Finite Automata -

Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March

### Divide-and-Conquer. Three main steps : 1. divide; 2. conquer; 3. merge.

Divide-and-Conquer Three main steps : 1. divide; 2. conquer; 3. merge. 1 Let I denote the (sub)problem instance and S be its solution. The divide-and-conquer strategy can be described as follows. Procedure

### 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

### ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction

ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove

### x 2 f 2 e 1 e 4 e 3 e 2 q f 4 x 4 f 3 x 3

Karl-Franzens-Universitat Graz & Technische Universitat Graz SPEZIALFORSCHUNGSBEREICH F 003 OPTIMIERUNG und KONTROLLE Projektbereich DISKRETE OPTIMIERUNG O. Aichholzer F. Aurenhammer R. Hainz New Results

### 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

### Outline 2.1 Graph Isomorphism 2.2 Automorphisms and Symmetry 2.3 Subgraphs, part 1

GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Abstract. Chapter focuses on the question of when two graphs are to be regarded as the same, on symmetries, and on subgraphs.. discusses the concept

### The Goldberg Rao Algorithm for the Maximum Flow Problem

The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }