On alternating products of graph relations

Size: px
Start display at page:

Download "On alternating products of graph relations"

Transcription

1 On alternating products of graph relations. Bodendiek Institut f. Mathematik und ihre Didaktik Christian-Albrechts-Universität Kiel.Lang Fachbereich Informatik Universität Hamburg Abstract It is well-known that one can give an elegant version of the Kuratowskitype theorem for the projective plane by means of the five elementary relations i, i = 0, 1,..., 4, on the set Γ of all finite, undirected graphs without loops and multiple edges. Furthermore, these five relations play an interesting role in didactics of mathematics. Following a theory given in [], C.Thies investigates them in []. In order to show that 0, 1,..., are an appropriate curriculum he has to deal with so-called alternating products T ( i ) T (i 1 ) T ( i ) T (i 1 )... or T (i 1 ) T ( i ) T (i 1 ) T ( i )..., i = 0, 1,..., 4, where T ( i ) denotes the reflexive transitive closure of i and T (i 1 ) = T ( i ) 1 the reflexive, transitive closure of i 1. Here, it is shown that, in case of i = 0, there exists exactly one alternating product in the set of all alternating products of 0, in case of i = and i = 4 the sets of all alternating products of and are infinite sets. 1

2 1 Introduction In the theory of embedding graphs into orientable and nonorientable surfaces, the five elementary relations 0, 1,...,, introduced in [1], play an important role because it is possible to give elegant and precise definitions of the subgraph relation and the subdivision relation and the minor relation on the set Γ of all finite, undirected graphs without loops and multiple edges. Observing that an ordered pair (, H) Γ Γ belongs to 0 iff H arises from by removing an edge e E() or an isolated vertex v V () the subgraph relation is equal to the reflexive, transitive closure T ( 0 ) of 0. An ordered pair (, H) Γ Γ belongs to 1 iff H arises from by contracting an edge e = {v, v } E(), provided at least one of the two endpoints v, v has got degree 1 or, and v, v do not have a common neighbour in. If U 1 = 0 1, then the well-known subdivision relation is equal to the reflexive, transitive closure T (U 1 ) of U 1 = 0 1. To give a precise definition of the famous minor relation on Γ we need 0, 1 and. An ordered pair (, H) Γ Γ belongs to iff H arises from by the contraction of an edge e = {v, v } E() provided v, v do not have a common neighbour in, and both v and v have got a degree. v v 1 v 1 v 1 v v u 1 u u v u u 1 v Q v u X v u O Figure 1: If U denotes the union U = 0 1, then the minor relation on Γ is equal to the reflexive, transitive closure T (U ) of U = 0 1.

3 v 1 v v u u u 1 v u v P (P) (P) u 4 (P) (P) = K 6 Figure : v 1 v v e D u u1 v1 u v u=v T u u 1 Figure :

4 It is almost superflous to mention that T ( 0 ), T (U 1 ), T (U ) are partial ordering relations on Γ while 0, 1, are not partial ordering relations on Γ. Now, it remains to give the definition of and. The great advantage of and and their reflexive, transitive closures T (U ), T (U 4 ), U i = i, i =, 4, is that we need essentially less graphs in order to characterize the set of all graphs not embeddable into an orientable or nonorientable surface. Due to [1], an ordered pair (, H) Γ Γ belongs to iff H arises from by substituting a star S = {v} {v 1, v, v }, v, v 1, v, v V (), by the triangle K = (v 1, v, v ) provided {v 1, v, v } is an independent set in V. Figure 1 shows that the octahedron O arises from the cube Q by applying twice. In other words, we can say that the ordered pair (Q, O), or equivalently (Q, O) T ( ). Figure shows a representation of the Petersen graph P and four other graphs (P ), (P ), (P ), (P ) in the projective plane such that it is clear that the ordered pair (P, K 6 ), or equivalently (P, K 6 ) T ( ). 1=u =v 1 1 u 1 v 1 u=6 v=5 u=v 4=v =u K, v u K 5 Figure 4: Due to [1] an ordered pair (, H) Γ Γ belongs to iff H arises from by substituting a double star D by a double triangle T (Figure ) provided 4

5 the edges {v 1, v } and {u 1, u } do not belong to. Figure 4 shows the decisive advantage of because the two Kuratowski graphs K 5 and K, have got the property that the ordered pair (K,, K 5 ). Alternating products In order to be able to define the concept of an alternating product it makes sense to introduce the converse relations of i, i = 0, 1,,, 4. Since we are going to restrict ourselves to the converse relations 0 1, 1 and 4 1 we omit the definitions of 1 1 and 1. Observing the definitions of 0, and we obtain a) an ordered pair (, H) Γ Γ belongs to 1 0 iff H arises from by adding an edge e P (V ) E or a new isolated vertex v / V, b) an ordered pair (, H) Γ Γ belongs to 1 iff H arises from by substituting a triangle C = (v 1, v, v ) by the star v {v 1, v, v } such that v is a new vertex, not belonging to, c) an ordered pair (, H) Γ Γ belongs to 1 4 iff H arises from by substituting a double triangle T (1-amalgamation of two disjoint triangles) by a double trihedral D (double star) (Figure ). Observing T (i 1 ) = T ( i ) 1, i = 0,, 4, we are able to introduce alternating products A i (n) and B i (n), i = 0,, 4, of n N, n, factors as follows { T (i ) T ( A i (n) = i ) 1... T ( i ) T ( i ) 1 if n 0 mod, T ( i ) T ( i ) 1... T ( i ) 1 T ( i ) if n 1 mod, { T (i ) B i (n) = 1 T ( i )... T ( i ) 1 T ( i ) if n 0 mod, T ( i ) 1 T ( i )... T ( i ) T ( i ) 1 if n 1 mod. If we denote the sets of all alternating products of i, i = 0,, 4, by A i and B i, defined as follows A i = {A i (n) n N {1}}, B i = {B i (n) n N {1}}, (1) we are going to investigate the question whether the sets A i and B i, i = 0,, 4, are finite or infinite. 5

6 The finiteness of A 0 and B 0 Since first investigations lead to suppose that A 0 = {A 0 (), A 0 (), A 0 (4),...} () and B 0 = {B 0 (), B 0 (), B 0 (4),...} () are finite we first restrict ourselves to A 0 () and B 0 (), and prove Theorem 1 A 0 () = B 0 () = Γ Γ (4) T ( 0 ) T ( 0 ) 1 = T ( 0 ) 1 T ( 0 ) = Γ Γ. Proof: Because of T ( 0 ) T ( 0 ) 1 Γ Γ and T ( 0 ) 1 T ( 0 ) Γ Γ it suffices to show the two inclusions (a) and (b) by (a) T ( 0 ) T ( 0 ) 1 Γ Γ and (b) T ( 0 ) 1 T ( 0 ) Γ Γ. Ad (a) : Observing the definitions of a subset and a composition of relations the inclusion (a) is equivalent to the proposition [(, X) T ( 0 ) (X, H) T ( 0 ) 1 ]. (5) (,H) Γ Γ X Γ Assume (, H) is any ordered pair in Γ Γ. As the intersection graph H is a subgraph of both and H we obtain (, H) T ( 0 ) and (H, H) T ( 0 ) such that ( H, H) T ( 0 ) 1. Putting X = H we obtain (, H) T ( 0 ) and ( H, H) T ( 0 ) 1 such that (5) is true. This fact proves the inclusion (a). Ad (b): Similarly to (a) the inclusion (b) is equivalent to the proposition (6) by [(, Y ) T ( 0 ) 1 (Y, H) T ( 0 )]. (6) (,H) Γ Γ Y Γ 6

7 The proof of (6) is done by choosing Y = H(= union graph of and H) for any graphs, H Γ for and H are subgraphs of Y = H implying ( H, ) T ( 0 ), ( H, H) T ( 0 ) and (, H) T ( 0 ) 1. This proves (b). The answer of the question asked above concerning the finiteness of A 0 and B 0 is an immediate consequence of theorem 1 and says as follows Theorem A 0 and B 0 are equal, finite sets and consist of exactly one element x = Γ Γ, i.e. A 0 = B 0 = {Γ Γ}. Proof: Observing Theorem l and the fact that the composition of relations on the sets of all relations on Γ is an associative binary operation, the statement of Theorem has been proved iff the two inclusions (7) and (8) by and Γ Γ (Γ Γ) T ( 0 ) (7) Γ Γ (Γ Γ) T ( 0 ) 1 (8) are true. It is obvious that (7) is true iff the statement [(, X) Γ Γ (X, H) T ( 0 )] (9) (,H) Γ Γ X Γ holds. Choosing X = H for any (, H) Γ Γ we recognize immediately that (7) is true. The proof of (8) is quite the same as the one of (7) such that we are allowed to omit details. This proves Theorem. After this beautiful proof we are going to turn to A and B and want to investigate the question whether these two sets are also finite. 4 The infinity of A and B Figure 5 shows the five graphs, 1,, and H that can be characterized by means of and 1 represented in Figure 6. It shows that the ordered pair (, H) belongs to A (4) = T ( ) T ( ) 1 T ( ) T ( ) 1 7

8 1 H Figure 5: but it is neither an element of A () nor of A (). A (4) A (i), i =,. This fact implies that Therefore, it is obvious that A has at least the three elements A (), A () and A (4). This fact implies that the situation of A and B is quite different from the situation of A 0 and B 0 such that we suppose that are A and B are even infinite sets. In order to give a proof of this assumption we generalize the example of figure 5 and prove Theorem A and B are infinite sets. Proof: (1) In order to show that A is infinite we suppose to argue by con- 8

9 1 1 H Figure 6: tradiction that A is finite. Then there necessarily exists a natural number n N, n, such that A = {A (), A (4),..., A (n 1)} with the property that there is an element k {,,..., n 1} for which the equality A (k) = A (n) holds. This is a contradiction to statement (10) by A (n) A (i). (10) i {,,...,n 1} In order to show that (10) is true we argue as follows. (10) is obviously shown, if and only if, we give an ordered pair (, H) A (n) not belonging to A (i) for any i {,,..., n 1}. It turns out that it is even possible to show that there is an ordered pair (, H) A (n) not belonging to A (i) for every i {,,..., n 1}. If n = k, k 1, is even then we generalize the graph from Figure 5. Thus we consider the graphs = (k) and H = n depicted in Figure 7. eneralizing the diagram of Figure 6 we recognize that the ordered pair (, H) = ((k), n ) is an element of but A (n) = T ( ) T ( ) 1... T ( ) T ( ) 1 (11) (, H) = ((k), n ) / A (i) 9

10 =(k) k quadrilaterals 1 k quadrilaterals 1 k quadrilaterals k- quadrilaterals n- n k quadrilaterals n H = n k quadrilaterals Figure 7: 10

11 for each i =,,..., n 1. Since the proof of these two statements is a matter of routine checking, we are allowed to omit details. In the case of odd n = k + 1, k 1, we can argue by observing Figure 8 and choosing (, H) = ( (k), n). A routine checking shows that (, H) A (n), but (, H) / A (i) for each i =,,..., n 1. After all, (10) is proved. This implies that our assumption is false and A is infinite. () To argue by contradiction we assume that B is finite. Then there exists an integer n such that B = {B (), B (),..., B (n 1)} with the property that there is an element k {,,..., n 1} for which A (n) is equal to A (k). This equality is a contradiction to statement (1) by B (n) B (i). (1) i {,,...,n 1} We prove (1) by showing the existence of an ordered pair (, H) B (n) not belonging to B (i) for every i {,,..., n 1}. It is useful to distinguish the two cases (a) n 0 mod and (b) n 1 mod. In (a) we take = X(k), n = k +, k 1, k = n and H = X k represented in Figure 9. Observing Figure 9 the proof of (, H) B (n) and (, H) / B (i) for each i =,,..., n 1 is a matter of routine checking. In case (b), n is odd such that n = k + 1, k 1. Then we choose for, H the graphs Y (k) and Y k+1 depicted in Figure 10. It is easy to see that (, H) B (n) and (, H) / B (i) for each i =,,..., n 1. Hence, the assumption is not true. That means that B is infinite. 5 The infinity of A 4 and B 4 In this section we turn toward the elementary relation 1. After having seen that A and B are infinite sets it is not difficult to guess that A 4 and B 4 are also infinite sets. The confirmation of this guess is given in Theorem 4 A 4 and B 4 are infinite sets. 11

12 1 = (k) k quadrilaterals 1 k quadrilaterals k quadrilaterals k- quadrilaterals n- n k quadrilaterals n H = n k quadrilaterals Figure 8: 1

13 =X(k) k= n- quadrilaterals X 1 k quadrilaterals X 1 X k quadrilaterals X X k quadrilaterals X k X k k quadrilaterals X k X k+1 k quadrilaterals X k+1 H = X k+ k quadrilaterals Figure 9: 1

14 Y k= n = Y(k) quadrilaterals Y 1 k quadrilaterals Y 1 Y k quadrilaterals Y k quadrilaterals Y k- Y k k quadrilaterals Y k Y k k quadrilaterals Y k H = Y k+1 k quadrilaterals Figure 10: 14

15 Proof: (1) It is evident that the main idea of this proof is similar to the idea of the proof of (1) in Theorem. Therefore, we omit details and restrict ourselves to the proof of statement (1) by i {,,...,n 1} A 4 (n) A 4 (i), (1) where n is assumed to be a positive integer with the property that A 4 consists of the elements A 4 (), A 4 (),..., A 4 (n 1). In order to find an ordered pair (, H) A 4 (n) not belonging to each A 4 (i), i =,,..., n 1, we distinguish the two cases n 0 mod and n 1 mod. In the first case n 0 mod, Figure 11 shows the graphs = (n) and H = n satisfying the properties mentioned above. The proof is not quite easy. In spite of his fact we cannot deal with details. In the second case n 1 mod, Figure 1 depicts the corresponding graphs = H(n) and H = H n. It is clear by means of Figure 1 that (, H) A 4 (n) and (, H) / A 4 (i) for each i =,,..., n 1 are true. This completes the proof of (1). Now we conclude by giving a sketch of the proof of (), where () says that B 4 is infinite. Having assumed that B 4 is finite we have to prove the statement i {,,...,n 1} B 4 (n) B 4 (i). (14) by giving an ordered pair (, H) B 4 (n) not belonging to each B 4 (i), i =,,..., n 1, where n is chosen as explained above. If n 0 mod Figure 1 proves that (14) is true for even n and = X(n) and H = X n. If n 1 mod we choose = Y (n) and H = Y n. Figure 14 shows that (, H) B 4 (n) and (, H) / B 4 (i) for each i =,,..., n 1. This completes the proof in the case (). That means that B 4 is infinite. 15

16 = (n) n triangles and n quadrilaterals n- n- n 4 n- 4 n H = n Figure 11: 16

17 = H(n) n triangles and n+1 quadrilaterals H 1 H H 1 H H H n- H n- H n- H n H n H = H n n triangles and n quadrilaterals Figure 1: 17

18 = X(n) n triangles n quadrilaterals X 1 4 X 1 X X X X n- X n- X n X n- X n H = X n n n triangles quadrilaterals Figure 1: 18

19 Y n = Y(n) n+1 triangles n quadrilaterals Y 1 Y 1 Y Y Y Y n- Y n- Y n- Y n H = Y n Figure 14: 19

20 eferences [1].Bodendiek, H.Schumacher, K.Wagner. Über elationen auf raphenmengen. Abhandlungen aus dem mathematischen Seminar der Universität Hamburg 51, [] D.Sawada. An assessment of a selected set of Piagetian-derived operators for the generation of effective learning hierarachies. JME 197. [] C.Thies. Zur Formalisierung des Piagetschen ruppierungsbegriffs unter besonderer Berücksichtigung graphentheoreticher elationen. Dissertation Kiel, 198. [4] K.Wagner,.Bodendiek. raphentheorie I, BI-Wissenschaftsverlag Mannheim [5] K.Wagner,.Bodendiek. raphentheorie II, BI-Wissenschaftsverlag Mannheim [6] K.Wagner,.Bodendiek. raphentheorie III, BI-Wissenschaftsverlag Mannheim

Planar Graphs (1) Planar Graphs (3) Planar Graphs (2) Planar Graphs (4)

Planar Graphs (1) Planar Graphs (3) Planar Graphs (2) Planar Graphs (4) S-72.2420/T-79.5203 Planarity; Edges and Cycles 1 Planar Graphs (1) Topological graph theory, broadly conceived, is the study of graph layouts. Contemporary applications include circuit layouts on silicon

More information

Outline Inverse of a Relation Properties of Relations. Relations. Alice E. Fischer. April, 2018

Outline Inverse of a Relation Properties of Relations. Relations. Alice E. Fischer. April, 2018 Relations Alice E. Fischer April, 2018 1 Inverse of a Relation 2 Properties of Relations The Inverse of a Relation Let R be a relation from A to B. Define the inverse relation, R 1 from B to A as follows.

More information

Partial cubes: structures, characterizations, and constructions

Partial cubes: structures, characterizations, and constructions Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes

More information

1.3 Vertex Degrees. Vertex Degree for Undirected Graphs: Let G be an undirected. Vertex Degree for Digraphs: Let D be a digraph and y V (D).

1.3 Vertex Degrees. Vertex Degree for Undirected Graphs: Let G be an undirected. Vertex Degree for Digraphs: Let D be a digraph and y V (D). 1.3. VERTEX DEGREES 11 1.3 Vertex Degrees Vertex Degree for Undirected Graphs: Let G be an undirected graph and x V (G). The degree d G (x) of x in G: the number of edges incident with x, each loop counting

More information

arxiv: v1 [math.co] 28 Oct 2016

arxiv: v1 [math.co] 28 Oct 2016 More on foxes arxiv:1610.09093v1 [math.co] 8 Oct 016 Matthias Kriesell Abstract Jens M. Schmidt An edge in a k-connected graph G is called k-contractible if the graph G/e obtained from G by contracting

More information

Even Cycles in Hypergraphs.

Even Cycles in Hypergraphs. Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and

More information

Introductory Analysis I Fall 2014 Homework #5 Solutions

Introductory Analysis I Fall 2014 Homework #5 Solutions Introductory Analysis I Fall 2014 Homework #5 Solutions 6. Let M be a metric space, let C D M. Now we can think of C as a subset of the metric space M or as a subspace of the metric space D (D being a

More information

Packing cycles with modularity constraints

Packing cycles with modularity constraints Packing cycles with modularity constraints Paul Wollan Mathematisches Seminar der Universität Hamburg Bundesstr. 55 20146 Hamburg, Germany Abstract We prove that for all positive integers k, there exists

More information

GUOLI DING AND STAN DZIOBIAK. 1. Introduction

GUOLI DING AND STAN DZIOBIAK. 1. Introduction -CONNECTED GRAPHS OF PATH-WIDTH AT MOST THREE GUOLI DING AND STAN DZIOBIAK Abstract. It is known that the list of excluded minors for the minor-closed class of graphs of path-width numbers in the millions.

More information

DECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE

DECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE Discussiones Mathematicae Graph Theory 30 (2010 ) 335 347 DECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE Jaroslav Ivančo Institute of Mathematics P.J. Šafári University, Jesenná 5 SK-041 54

More information

and e 2 ~ e 2 iff e 1

and e 2 ~ e 2 iff e 1 Section 4. Equivalence Relations A binary relation is an equivalence relation if it has the three properties reflexive, symmetric, and transitive (RST). Examples. a. Equality on any set. b. x ~ y iff x

More information

Generalized Pigeonhole Properties of Graphs and Oriented Graphs

Generalized Pigeonhole Properties of Graphs and Oriented Graphs Europ. J. Combinatorics (2002) 23, 257 274 doi:10.1006/eujc.2002.0574 Available online at http://www.idealibrary.com on Generalized Pigeonhole Properties of Graphs and Oriented Graphs ANTHONY BONATO, PETER

More information

Section Summary. Relations and Functions Properties of Relations. Combining Relations

Section Summary. Relations and Functions Properties of Relations. Combining Relations Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included

More information

5. Partitions and Relations Ch.22 of PJE.

5. Partitions and Relations Ch.22 of PJE. 5. Partitions and Relations Ch. of PJE. We now generalize the ideas of congruence classes of Z to classes of any set X. The properties of congruence classes that we start with here are that they are disjoint

More information

Chapter 9: Relations Relations

Chapter 9: Relations Relations Chapter 9: Relations 9.1 - Relations Definition 1 (Relation). Let A and B be sets. A binary relation from A to B is a subset R A B, i.e., R is a set of ordered pairs where the first element from each pair

More information

Characterizing binary matroids with no P 9 -minor

Characterizing binary matroids with no P 9 -minor 1 2 Characterizing binary matroids with no P 9 -minor Guoli Ding 1 and Haidong Wu 2 1. Department of Mathematics, Louisiana State University, Baton Rouge, Louisiana, USA Email: ding@math.lsu.edu 2. Department

More information

The power graph of a finite group, II

The power graph of a finite group, II The power graph of a finite group, II Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, U.K. Abstract The directed power graph of a group G

More information

Definition: A binary relation R from a set A to a set B is a subset R A B. Example:

Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.

More information

Packing and decomposition of graphs with trees

Packing and decomposition of graphs with trees Packing and decomposition of graphs with trees Raphael Yuster Department of Mathematics University of Haifa-ORANIM Tivon 36006, Israel. e-mail: raphy@math.tau.ac.il Abstract Let H be a tree on h 2 vertices.

More information

arxiv: v2 [math.gr] 17 Dec 2017

arxiv: v2 [math.gr] 17 Dec 2017 The complement of proper power graphs of finite groups T. Anitha, R. Rajkumar arxiv:1601.03683v2 [math.gr] 17 Dec 2017 Department of Mathematics, The Gandhigram Rural Institute Deemed to be University,

More information

4 Packing T-joins and T-cuts

4 Packing T-joins and T-cuts 4 Packing T-joins and T-cuts Introduction Graft: A graft consists of a connected graph G = (V, E) with a distinguished subset T V where T is even. T-cut: A T -cut of G is an edge-cut C which separates

More information

The Algorithmic Aspects of the Regularity Lemma

The Algorithmic Aspects of the Regularity Lemma The Algorithmic Aspects of the Regularity Lemma N. Alon R. A. Duke H. Lefmann V. Rödl R. Yuster Abstract The Regularity Lemma of Szemerédi is a result that asserts that every graph can be partitioned in

More information

Theory of Computer Science. Theory of Computer Science. E5.1 Routing Problems. E5.2 Packing Problems. E5.3 Conclusion.

Theory of Computer Science. Theory of Computer Science. E5.1 Routing Problems. E5.2 Packing Problems. E5.3 Conclusion. Theory of Computer Science May 31, 2017 E5. Some NP-Complete Problems, Part II Theory of Computer Science E5. Some NP-Complete Problems, Part II E5.1 Routing Problems Malte Helmert University of Basel

More information

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c. Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called

More information

Properties of the Integers

Properties of the Integers Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called

More information

The cocycle lattice of binary matroids

The cocycle lattice of binary matroids Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*

More information

GIRTH SIX CUBIC GRAPHS HAVE PETERSEN MINORS

GIRTH SIX CUBIC GRAPHS HAVE PETERSEN MINORS GIRTH SIX CUBIC GRAPHS HAVE PETERSEN MINORS Neil Robertson 1 Department of Mathematics Ohio State University 231 W. 18th Ave. Columbus, Ohio 43210, USA P. D. Seymour Bellcore 445 South St. Morristown,

More information

Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs

Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs inite Induced Graph Ramsey Theory: On Partitions of Subgraphs David S. Gunderson and Vojtěch Rödl Emory University, Atlanta GA 30322. Norbert W. Sauer University of Calgary, Calgary, Alberta, Canada T2N

More information

Sergey Norin Department of Mathematics and Statistics McGill University Montreal, Quebec H3A 2K6, Canada. and

Sergey Norin Department of Mathematics and Statistics McGill University Montreal, Quebec H3A 2K6, Canada. and NON-PLANAR EXTENSIONS OF SUBDIVISIONS OF PLANAR GRAPHS Sergey Norin Department of Mathematics and Statistics McGill University Montreal, Quebec H3A 2K6, Canada and Robin Thomas 1 School of Mathematics

More information

Partial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs

Partial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs Partial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs Flavia Bonomo a,1, Maria Chudnovsky b,2 and Guillermo Durán c,3 a Departamento de Matemática, Facultad

More information

Chordal Graphs, Interval Graphs, and wqo

Chordal Graphs, Interval Graphs, and wqo Chordal Graphs, Interval Graphs, and wqo Guoli Ding DEPARTMENT OF MATHEMATICS LOUISIANA STATE UNIVERSITY BATON ROUGE, LA 70803-4918 E-mail: ding@math.lsu.edu Received July 29, 1997 Abstract: Let be the

More information

MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X.

MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X. MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X. Notation 2 A set can be described using set-builder notation. That is, a set can be described

More information

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of

More information

Bi-Arc Digraphs and Conservative Polymorphisms

Bi-Arc Digraphs and Conservative Polymorphisms Bi-Arc Digraphs and Conservative Polymorphisms Pavol Hell Arash Rafiey arxiv:1608.03368v3 [cs.ds] 29 Dec 2016 Abstract We introduce the class of bi-arc digraphs, and show they coincide with the class of

More information

15.1 Matching, Components, and Edge cover (Collaborate with Xin Yu)

15.1 Matching, Components, and Edge cover (Collaborate with Xin Yu) 15.1 Matching, Components, and Edge cover (Collaborate with Xin Yu) First show l = c by proving l c and c l. For a maximum matching M in G, let V be the set of vertices covered by M. Since any vertex in

More information

Cographs; chordal graphs and tree decompositions

Cographs; chordal graphs and tree decompositions Cographs; chordal graphs and tree decompositions Zdeněk Dvořák September 14, 2015 Let us now proceed with some more interesting graph classes closed on induced subgraphs. 1 Cographs The class of cographs

More information

Blocks and 2-blocks of graph-like spaces

Blocks and 2-blocks of graph-like spaces Blocks and 2-blocks of graph-like spaces von Hendrik Heine Masterarbeit vorgelegt der Fakultät für Mathematik, Informatik und Naturwissenschaften der Universität Hamburg im Dezember 2017 Gutachter: Prof.

More information

MINIMALLY NON-PFAFFIAN GRAPHS

MINIMALLY NON-PFAFFIAN GRAPHS MINIMALLY NON-PFAFFIAN GRAPHS SERGUEI NORINE AND ROBIN THOMAS Abstract. We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-pfaffian graphs minimal with respect

More information

Spanning Paths in Infinite Planar Graphs

Spanning Paths in Infinite Planar Graphs Spanning Paths in Infinite Planar Graphs Nathaniel Dean AT&T, ROOM 2C-415 600 MOUNTAIN AVENUE MURRAY HILL, NEW JERSEY 07974-0636, USA Robin Thomas* Xingxing Yu SCHOOL OF MATHEMATICS GEORGIA INSTITUTE OF

More information

Observation 4.1 G has a proper separation of order 0 if and only if G is disconnected.

Observation 4.1 G has a proper separation of order 0 if and only if G is disconnected. 4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H, K) with H K = G and E(H K) = and V (H) V (K) = k. Such a separation is proper if V (H) \ V (K) and V (K)

More information

The tree-like connectivity structure of finite graphs and matroids

The tree-like connectivity structure of finite graphs and matroids The tree-like connectivity structure of finite graphs and matroids Dissertation zur Erlangung des Doktorgrades der Fakultät für Mathematik, Informatik und Naturwissenschaften der Universität Hamburg vorgelegt

More information

Group connectivity of certain graphs

Group connectivity of certain graphs Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected

More information

Observation 4.1 G has a proper separation of order 0 if and only if G is disconnected.

Observation 4.1 G has a proper separation of order 0 if and only if G is disconnected. 4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H 1, H 2 ) so that H 1 H 2 = G E(H 1 ) E(H 2 ) = V (H 1 ) V (H 2 ) = k Such a separation is proper if V (H

More information

Measures. 1 Introduction. These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland.

Measures. 1 Introduction. These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland. Measures These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland. 1 Introduction Our motivation for studying measure theory is to lay a foundation

More information

Strongly chordal and chordal bipartite graphs are sandwich monotone

Strongly chordal and chordal bipartite graphs are sandwich monotone Strongly chordal and chordal bipartite graphs are sandwich monotone Pinar Heggernes Federico Mancini Charis Papadopoulos R. Sritharan Abstract A graph class is sandwich monotone if, for every pair of its

More information

Graphs & Algorithms: Advanced Topics Nowhere-Zero Flows

Graphs & Algorithms: Advanced Topics Nowhere-Zero Flows Graphs & Algorithms: Advanced Topics Nowhere-Zero Flows Uli Wagner ETH Zürich Flows Definition Let G = (V, E) be a multigraph (allow loops and parallel edges). An (integer-valued) flow on G (also called

More information

Advanced Combinatorial Optimization September 22, Lecture 4

Advanced Combinatorial Optimization September 22, Lecture 4 8.48 Advanced Combinatorial Optimization September 22, 2009 Lecturer: Michel X. Goemans Lecture 4 Scribe: Yufei Zhao In this lecture, we discuss some results on edge coloring and also introduce the notion

More information

4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**

4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu** 4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published

More information

arxiv: v1 [cs.ds] 2 Oct 2018

arxiv: v1 [cs.ds] 2 Oct 2018 Contracting to a Longest Path in H-Free Graphs Walter Kern 1 and Daniël Paulusma 2 1 Department of Applied Mathematics, University of Twente, The Netherlands w.kern@twente.nl 2 Department of Computer Science,

More information

1.4 Equivalence Relations and Partitions

1.4 Equivalence Relations and Partitions 24 CHAPTER 1. REVIEW 1.4 Equivalence Relations and Partitions 1.4.1 Equivalence Relations Definition 1.4.1 (Relation) A binary relation or a relation on a set S is a set R of ordered pairs. This is a very

More information

Forcing unbalanced complete bipartite minors

Forcing unbalanced complete bipartite minors Forcing unbalanced complete bipartite minors Daniela Kühn Deryk Osthus Abstract Myers conjectured that for every integer s there exists a positive constant C such that for all integers t every graph of

More information

Fine structure of 4-critical triangle-free graphs III. General surfaces

Fine structure of 4-critical triangle-free graphs III. General surfaces Fine structure of 4-critical triangle-free graphs III. General surfaces Zdeněk Dvořák Bernard Lidický February 16, 2017 Abstract Dvořák, Král and Thomas [4, 6] gave a description of the structure of triangle-free

More information

Technische Universität Ilmenau Institut für Mathematik

Technische Universität Ilmenau Institut für Mathematik Technische Universität Ilmenau Institut für Mathematik Preprint No. M 09/35 Null-homotopic graphs and triangle-completions of spanning trees Rautenbach, Dieter; Schäfer, Philipp Matthias 2009 Impressum:

More information

arxiv:math/ v1 [math.gm] 21 Jan 2005

arxiv:math/ v1 [math.gm] 21 Jan 2005 arxiv:math/0501341v1 [math.gm] 21 Jan 2005 SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, I. THE MAIN REPRESENTATION THEOREM MARINA SEMENOVA AND FRIEDRICH WEHRUNG Abstract. For a partially ordered set P,

More information

INDEPENDENT TRANSVERSAL DOMINATION IN GRAPHS

INDEPENDENT TRANSVERSAL DOMINATION IN GRAPHS Discussiones Mathematicae Graph Theory 32 (2012) 5 17 INDEPENDENT TRANSVERSAL DOMINATION IN GRAPHS Ismail Sahul Hamid Department of Mathematics The Madura College Madurai, India e-mail: sahulmat@yahoo.co.in

More information

Nowhere zero flow. Definition: A flow on a graph G = (V, E) is a pair (D, f) such that. 1. D is an orientation of G. 2. f is a function on E.

Nowhere zero flow. Definition: A flow on a graph G = (V, E) is a pair (D, f) such that. 1. D is an orientation of G. 2. f is a function on E. Nowhere zero flow Definition: A flow on a graph G = (V, E) is a pair (D, f) such that 1. D is an orientation of G. 2. f is a function on E. 3. u N + D (v) f(uv) = w ND f(vw) for every (v) v V. Example:

More information

Induced Saturation of Graphs

Induced Saturation of Graphs Induced Saturation of Graphs Maria Axenovich a and Mónika Csikós a a Institute of Algebra and Geometry, Karlsruhe Institute of Technology, Englerstraße 2, 76128 Karlsruhe, Germany Abstract A graph G is

More information

THE EXTREMAL FUNCTIONS FOR TRIANGLE-FREE GRAPHS WITH EXCLUDED MINORS 1

THE EXTREMAL FUNCTIONS FOR TRIANGLE-FREE GRAPHS WITH EXCLUDED MINORS 1 THE EXTREMAL FUNCTIONS FOR TRIANGLE-FREE GRAPHS WITH EXCLUDED MINORS 1 Robin Thomas and Youngho Yoo School of Mathematics Georgia Institute of Technology Atlanta, Georgia 0-0160, USA We prove two results:

More information

Even Pairs and Prism Corners in Square-Free Berge Graphs

Even Pairs and Prism Corners in Square-Free Berge Graphs Even Pairs and Prism Corners in Square-Free Berge Graphs Maria Chudnovsky Princeton University, Princeton, NJ 08544 Frédéric Maffray CNRS, Laboratoire G-SCOP, University of Grenoble-Alpes, France Paul

More information

The Minimum Rank, Inverse Inertia, and Inverse Eigenvalue Problems for Graphs. Mark C. Kempton

The Minimum Rank, Inverse Inertia, and Inverse Eigenvalue Problems for Graphs. Mark C. Kempton The Minimum Rank, Inverse Inertia, and Inverse Eigenvalue Problems for Graphs Mark C. Kempton A thesis submitted to the faculty of Brigham Young University in partial fulfillment of the requirements for

More information

BOOLEAN ALGEBRA INTRODUCTION SUBSETS

BOOLEAN ALGEBRA INTRODUCTION SUBSETS BOOLEAN ALGEBRA M. Ragheb 1/294/2018 INTRODUCTION Modern algebra is centered around the concept of an algebraic system: A, consisting of a set of elements: ai, i=1, 2,, which are combined by a set of operations

More information

Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies

Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies Zdeněk Dvořák Daniel Král Robin Thomas Abstract We settle a problem of Havel by showing that there exists

More information

NOTES ON MATCHINGS IN CONVERGENT GRAPH SEQUENCES

NOTES ON MATCHINGS IN CONVERGENT GRAPH SEQUENCES NOTES ON MATCHINGS IN CONVERGENT GRAPH SEQUENCES HARRY RICHMAN Abstract. These are notes on the paper Matching in Benjamini-Schramm convergent graph sequences by M. Abért, P. Csikvári, P. Frenkel, and

More information

Rao s degree sequence conjecture

Rao s degree sequence conjecture Rao s degree sequence conjecture Maria Chudnovsky 1 Columbia University, New York, NY 10027 Paul Seymour 2 Princeton University, Princeton, NJ 08544 July 31, 2009; revised December 10, 2013 1 Supported

More information

A Separator Theorem for Graphs with an Excluded Minor and its Applications

A Separator Theorem for Graphs with an Excluded Minor and its Applications A Separator Theorem for Graphs with an Excluded Minor and its Applications Noga Alon IBM Almaden Research Center, San Jose, CA 95120,USA and Sackler Faculty of Exact Sciences, Tel Aviv University, Tel

More information

Extremal Graphs Having No Stable Cutsets

Extremal Graphs Having No Stable Cutsets Extremal Graphs Having No Stable Cutsets Van Bang Le Institut für Informatik Universität Rostock Rostock, Germany le@informatik.uni-rostock.de Florian Pfender Department of Mathematics and Statistics University

More information

ABOUT THE CLASS AND NOTES ON SET THEORY

ABOUT THE CLASS AND NOTES ON SET THEORY ABOUT THE CLASS AND NOTES ON SET THEORY About the Class Evaluation. Final grade will be based 25%, 25%, 25%, 25%, on homework, midterm 1, midterm 2, final exam. Exam dates. Midterm 1: Oct 4. Midterm 2:

More information

d 2 -coloring of a Graph

d 2 -coloring of a Graph d -coloring of a Graph K. Selvakumar and S. Nithya Department of Mathematics Manonmaniam Sundaranar University Tirunelveli 67 01, Tamil Nadu, India E-mail: selva 158@yahoo.co.in Abstract A subset S of

More information

Design and Analysis of Algorithms

Design and Analysis of Algorithms Design and Analysis of Algorithms CSE 5311 Lecture 25 NP Completeness Junzhou Huang, Ph.D. Department of Computer Science and Engineering CSE5311 Design and Analysis of Algorithms 1 NP-Completeness Some

More information

Out-colourings of Digraphs

Out-colourings of Digraphs Out-colourings of Digraphs N. Alon J. Bang-Jensen S. Bessy July 13, 2017 Abstract We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an out-colouring.

More information

10.4 The Kruskal Katona theorem

10.4 The Kruskal Katona theorem 104 The Krusal Katona theorem 141 Example 1013 (Maximum weight traveling salesman problem We are given a complete directed graph with non-negative weights on edges, and we must find a maximum weight Hamiltonian

More information

Probe interval graphs and probe unit interval graphs on superclasses of cographs

Probe interval graphs and probe unit interval graphs on superclasses of cographs Author manuscript, published in "" Discrete Mathematics and Theoretical Computer Science DMTCS vol. 15:2, 2013, 177 194 Probe interval graphs and probe unit interval graphs on superclasses of cographs

More information

2016 EF Exam Texas A&M High School Students Contest Solutions October 22, 2016

2016 EF Exam Texas A&M High School Students Contest Solutions October 22, 2016 6 EF Exam Texas A&M High School Students Contest Solutions October, 6. Assume that p and q are real numbers such that the polynomial x + is divisible by x + px + q. Find q. p Answer Solution (without knowledge

More information

The Reduction of Graph Families Closed under Contraction

The Reduction of Graph Families Closed under Contraction The Reduction of Graph Families Closed under Contraction Paul A. Catlin, Department of Mathematics Wayne State University, Detroit MI 48202 November 24, 2004 Abstract Let S be a family of graphs. Suppose

More information

On the intersection of infinite matroids

On the intersection of infinite matroids On the intersection of infinite matroids Elad Aigner-Horev Johannes Carmesin Jan-Oliver Fröhlich University of Hamburg 9 July 2012 Abstract We show that the infinite matroid intersection conjecture of

More information

Independent Transversals in r-partite Graphs

Independent Transversals in r-partite Graphs Independent Transversals in r-partite Graphs Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract Let G(r, n) denote

More information

1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3

1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3 Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,

More information

Relations Graphical View

Relations Graphical View Introduction Relations Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Recall that a relation between elements of two sets is a subset of their Cartesian

More information

On uniquely 3-colorable plane graphs without prescribed adjacent faces 1

On uniquely 3-colorable plane graphs without prescribed adjacent faces 1 arxiv:509.005v [math.co] 0 Sep 05 On uniquely -colorable plane graphs without prescribed adjacent faces Ze-peng LI School of Electronics Engineering and Computer Science Key Laboratory of High Confidence

More information

ALL GRAPHS WITH PAIRED-DOMINATION NUMBER TWO LESS THAN THEIR ORDER. Włodzimierz Ulatowski

ALL GRAPHS WITH PAIRED-DOMINATION NUMBER TWO LESS THAN THEIR ORDER. Włodzimierz Ulatowski Opuscula Math. 33, no. 4 (2013), 763 783 http://dx.doi.org/10.7494/opmath.2013.33.4.763 Opuscula Mathematica ALL GRAPHS WITH PAIRED-DOMINATION NUMBER TWO LESS THAN THEIR ORDER Włodzimierz Ulatowski Communicated

More information

CHAPTER 1 SETS AND EVENTS

CHAPTER 1 SETS AND EVENTS CHPTER 1 SETS ND EVENTS 1.1 Universal Set and Subsets DEFINITION: set is a well-defined collection of distinct elements in the universal set. This is denoted by capital latin letters, B, C, If an element

More information

Every 3-connected, essentially 11-connected line graph is hamiltonian

Every 3-connected, essentially 11-connected line graph is hamiltonian Every 3-connected, essentially 11-connected line graph is hamiltonian Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou October 2, 25 Abstract Thomassen conjectured that every 4-connected line graph is hamiltonian.

More information

Diskrete Mathematik und Optimierung

Diskrete Mathematik und Optimierung Diskrete Mathematik und Optimierung Winfried Hochstättler, Robert Nickel: On the Chromatic Number of an Oriented Matroid Technical Report feu-dmo007.07 Contact: winfried.hochstaettler@fernuni-hagen.de

More information

Laplacian Integral Graphs with Maximum Degree 3

Laplacian Integral Graphs with Maximum Degree 3 Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,

More information

4-coloring P 6 -free graphs with no induced 5-cycles

4-coloring P 6 -free graphs with no induced 5-cycles 4-coloring P 6 -free graphs with no induced 5-cycles Maria Chudnovsky Department of Mathematics, Princeton University 68 Washington Rd, Princeton NJ 08544, USA mchudnov@math.princeton.edu Peter Maceli,

More information

Hamiltonicity exponent of digraphs

Hamiltonicity exponent of digraphs Publ. I.R.M.A. Strasbourg, 1995, Actes 33 e Séminaire Lotharingien, p. 1-5 Hamiltonicity exponent of digraphs Günter Schaar Fakultät für Mathematik und Informatik TU Bergakademie Freiberg 0. Initiated

More information

MATH 2200 Final LC Review

MATH 2200 Final LC Review MATH 2200 Final LC Review Thomas Goller April 25, 2013 1 Final LC Format The final learning celebration will consist of 12-15 claims to be proven or disproven. It will take place on Wednesday, May 1, from

More information

CS 301: Complexity of Algorithms (Term I 2008) Alex Tiskin Harald Räcke. Hamiltonian Cycle. 8.5 Sequencing Problems. Directed Hamiltonian Cycle

CS 301: Complexity of Algorithms (Term I 2008) Alex Tiskin Harald Räcke. Hamiltonian Cycle. 8.5 Sequencing Problems. Directed Hamiltonian Cycle 8.5 Sequencing Problems Basic genres. Packing problems: SET-PACKING, INDEPENDENT SET. Covering problems: SET-COVER, VERTEX-COVER. Constraint satisfaction problems: SAT, 3-SAT. Sequencing problems: HAMILTONIAN-CYCLE,

More information

Fractal property of the graph homomorphism order

Fractal property of the graph homomorphism order Fractal property of the graph homomorphism order Jiří Fiala a,1, Jan Hubička b,2, Yangjing Long c,3, Jaroslav Nešetřil b,2 a Department of Applied Mathematics Charles University Prague, Czech Republic

More information

Kruskal s Theorem Rebecca Robinson May 29, 2007

Kruskal s Theorem Rebecca Robinson May 29, 2007 Kruskal s Theorem Rebecca Robinson May 29, 2007 Kruskal s Theorem Rebecca Robinson 1 Quasi-ordered set A set Q together with a relation is quasi-ordered if is: reflexive (a a); and transitive (a b c a

More information

Basic counting techniques. Periklis A. Papakonstantinou Rutgers Business School

Basic counting techniques. Periklis A. Papakonstantinou Rutgers Business School Basic counting techniques Periklis A. Papakonstantinou Rutgers Business School i LECTURE NOTES IN Elementary counting methods Periklis A. Papakonstantinou MSIS, Rutgers Business School ALL RIGHTS RESERVED

More information

Modular Monochromatic Colorings, Spectra and Frames in Graphs

Modular Monochromatic Colorings, Spectra and Frames in Graphs Western Michigan University ScholarWorks at WMU Dissertations Graduate College 12-2014 Modular Monochromatic Colorings, Spectra and Frames in Graphs Chira Lumduanhom Western Michigan University, chira@swu.ac.th

More information

Hamilton cycles and closed trails in iterated line graphs

Hamilton cycles and closed trails in iterated line graphs Hamilton cycles and closed trails in iterated line graphs Paul A. Catlin, Department of Mathematics Wayne State University, Detroit MI 48202 USA Iqbalunnisa, Ramanujan Institute University of Madras, Madras

More information

Part V. Matchings. Matching. 19 Augmenting Paths for Matchings. 18 Bipartite Matching via Flows

Part V. Matchings. Matching. 19 Augmenting Paths for Matchings. 18 Bipartite Matching via Flows Matching Input: undirected graph G = (V, E). M E is a matching if each node appears in at most one Part V edge in M. Maximum Matching: find a matching of maximum cardinality Matchings Ernst Mayr, Harald

More information

On certain Regular Maps with Automorphism group PSL(2, p) Martin Downs

On certain Regular Maps with Automorphism group PSL(2, p) Martin Downs BULLETIN OF THE GREEK MATHEMATICAL SOCIETY Volume 53, 2007 (59 67) On certain Regular Maps with Automorphism group PSL(2, p) Martin Downs Received 18/04/2007 Accepted 03/10/2007 Abstract Let p be any prime

More information

Part III. 10 Topological Space Basics. Topological Spaces

Part III. 10 Topological Space Basics. Topological Spaces Part III 10 Topological Space Basics Topological Spaces Using the metric space results above as motivation we will axiomatize the notion of being an open set to more general settings. Definition 10.1.

More information

arxiv: v1 [cs.dm] 24 Jan 2008

arxiv: v1 [cs.dm] 24 Jan 2008 5-cycles and the Petersen graph arxiv:0801.3714v1 [cs.dm] 24 Jan 2008 M. DeVos, V. V. Mkrtchyan, S. S. Petrosyan, Department of Mathematics, Simon Fraser University, Canada Department of Informatics and

More information

Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008

Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Closed sets We have been operating at a fundamental level at which a topological space is a set together

More information

COMP 182 Algorithmic Thinking. Relations. Luay Nakhleh Computer Science Rice University

COMP 182 Algorithmic Thinking. Relations. Luay Nakhleh Computer Science Rice University COMP 182 Algorithmic Thinking Relations Luay Nakhleh Computer Science Rice University Chapter 9, Section 1-6 Reading Material When we defined the Sorting Problem, we stated that to sort the list, the elements

More information

Crossing-Number Critical Graphs have Bounded Path-width

Crossing-Number Critical Graphs have Bounded Path-width Crossing-Number Critical Graphs have Bounded Path-width Petr Hliněný School of Mathematical and Computing Sciences, Victoria University of Wellington, New Zealand hlineny@member.ams.org Current mailing

More information