Tope Graph of Oriented Matroids
|
|
- Nickolas Hancock
- 5 years ago
- Views:
Transcription
1 Tope Graph of Oriented Matroids Clara Brioschi, Legi: st December Introduction and Definitions In this report I will first define tope graphs of oriented matroids and their geometric interpretation. Then, I will outline and prove their main properties. Definition 1. A graph G = (V (G), E(G)) is a pair of finite set of vertices V (G) and a set of edges E(G), which are undirected. A graph G is said to be connected if every pair of vertices in the graph are connected, i.e. ther exists a path from one to the other. For a connected graph G we denote: d G (v, w) = min{ V V E(G), V path connecting v and w} diam(g) = max {d G(v, w)} v,w V (G) Definition 2. Two graphs G and G are called isomorphic if there exists a bijection φ : V (G) V (G ) such that {φ(v), φ(w)} E(G ) {v, w} E(G) and φ is called graph isomorphism. In case that G = G φ is called graph automorphism. Definition 3. Let (E, T ) be a pair of a finite set E and T {+,, 0} E such that all sign vectors in T have the same support. The tope graph of (E, T ) is a graph G with exactly T vertices that can be associated as a bijection L : V (G) T such that: {x, y} E(G) D(L(x), L(y)) is a parallel class of T (2) In particular, if T is the tope graph of an oriented matroid M, then G is called the tope graph of M and L is called its associating bijection. Definition 4 (Alternative Definition of tope graph of an oriented matroid). Let (E, F ) be an oriented matroid with tope set T. Its tope graph G is a graph with exactly f d = T vertices that can be associated by a bijection L : V (G) T such that {x, y} E(G) if and only if L(x) and L(y) have a lower common neighbor in the big face lattice. Remark 1. We can easily prove that Definition 3 and Definition 4 are equivalent by recalling that the parallel classes of T are the same as those of F and by observing that if X, Y T then there exists a (d-1)-face Z F such that Z X and Z Y Z is of the form Z \ D := X \ D = Y \ D and Z D = 0 (1) 1
2 Figure 1: Pseudosphere arrangement and tope graph of an oriented matroid 1.1 Geometric Interpretation of Tope Graphs Consider the pseudosphere arrangement of a d-dimensional oriented matroid (Figure 1 ). We define regions the cells of maximal dimension d-1 and topes their corresponding covectors. Two regions are called adjacent if they have a common (d-2)-dimensional face. This is the case if and only if their corresponding topes X and Y disagree in exactly one element. This defines an adjacency notion for topes. In the tope graph, every vertex corresponds to a tope and two vertices are connected if their corresponding topes disagree in exactly one element, i.e. their corresponding regions in the pseudosphere arrangement are adjacent. (Figure 1 ). Remark 2. In the pseudosphere arrangement a region is adjacent to exactly other three regions. This property is also reflected to the tope grpah, where each vertex is adjacent to just other three vertices. 1.2 Operations between Sign Vectors Let F {, +, 0} E. Definition 5. A Relabeling of F is a set F {, +, 0} E that there exists a bijection φ : F F and a bijection with E finite such such that ψ : {[e] E e is not a loop of F} {[e ] E e is not a loop of F } X e = φ(x) e and ψ([e]) = [e ] for every e E and e E no loops of E and E respectively. A Reorientation of F is a set of sign vectors of the form: { S X X F } for some S E F is said to be isomorphic to F if F can be obtained from F by relabeling first and reorienting. 2
3 Relabeling, reorientation and isomorphism define equivalence relations for sets of sign vectors. Relabeling and so isomorphism motivate the introduction of operation of deleting parallel elements and loops. In this way we can obtain an isomorphic set of sign vectors without loops and whose parallel classes contain only one element. Definition 6. F is called simple if it contains no loops and no parallel elements e f. An oriented matroid (E, F ) is called simple if F is simple. A simplification of F is a set of sign vectors which is isomorphic to F. The followiong lemma shows that we can consider tope graphs of simple oriented matroids without loss of generality. Lemma 1. The tope graph of a set T is equal to the tope graph of any simplification of T. More generally, the tope graphs of any isomorphic sets of sign vectors are equal. Proof. The proof is very simple. You just need to remember that we have defined tope graphs by relating to the concept of big face lattice (Definition 4 ), which we know to be invariant under the operations of relabeling and reorientation. 2 Properties of Tope Graphs There are two main problems in which we are concerned reguarding tope graphs: Characterization Problem: given a tope graph G = (V (G), E(G)), decide whether G is the tope graph of some oriented matroid; Reconstruction Problem: given a tope graph G = (V (G), E(G)) of some oriented matroid, find an oriented matroid M such that G is the tope graph of M. In order to deal with these problemes, we need to discuss some important properties of tope graphs. In particular, we first introduce the notions of L 1 systems and acycloids which generalize the tope sets of oriented matroids. Definition 7. Let (E, T ) be a pair of a finite set E and a set T {, +} E. We define the following properties: (A1): X, Y T such that X Y, e D(X, Y ) and Z T, such that: Z e = X e and Z \ e = X \ e i.e., if Z and X differs only by the element e E. (A2): (symmetry) if X T then X T. Definition 8. A pair (E, T ) of a finite set E and a set T {, +} E is called L 1 system if it satisfies property (A1). If it also satisfies property (A2), then it is called an acycloid. The following lemma proves that the acycloid is a generalization of an oriented matroid. 3
4 Lemma 2. Let M = (E, F ) be a simple oriented matroid. Then (E, T ) is an acycloid, where T is the tope set of M. In order to prove this lemma, we need the following property of tope sets. Recall 1 (Orientation Property of tope sets of an oriented matroid). For every X and Y in T, with X different from Y, there exists a parallel class S contained in D(X, Y ), such that S X is in T. Proof. Since M is a simple oriented matroid it has no loops, thus its tope set T {, +} E. We now prove that property (A1) is equivalent to the orientation property in Recall 1. We know that F is simple, thus every parallel class has exaclty one element. This means that the set S in the orientation property is composed of only one element, say e. Thus, this property becomes: X, Y T, X Y, e D(X, Y ) such that e X T Z T such that Z e = X e and Z \ e = X \ e which is exactly property (A1). Property (A2) follows by the symmetry of covectors. Property 1. If (E, T ) is an L 1 system and G its tope graph with associating bijection L : V (G) T, then Proof. By definition of tope graph : E(G) = {{x, y} D(L(x), L(y)) = 1} (3) {x, y} E(G) D(L(x), L(y)) is a parallel class of T, but an L 1 system is simple, thus its parallel classes contain only one element. It follows that in this case we can write Equation 2 as: {x, y} E(G) D(L(x), L(y)) = {e} D(L(x), L(y)) = 1. The following property states that tope graphs of an L 1 system can be isometrically embedded in some higher-dimensional hypercube. In particular, isometrically means that the distances in the tope graph are the same as in the hypercube. Property 2. If (E, T ) is an L 1 system and G its tope graph with associating bijection L : V (G) T, then d G (x, y) = D(L(x), L(y)) x, y V (G) (4) 4
5 Proof. For semplicity, let us denote X := L(x) and Y := L(y). We prove this property by induction on the dimension of the separating set D(X, Y ). If D(X, Y ) = 0 then x = y by Property 1 and d G (x, y) = 0. If D(X, Y ) = 1, then the result follows by Property 1. Now, suppose D(X, Y ) > 1. We first prove that d G (x, y) D(L(x), L(y)). By assumption, X Y, thus by property (A1) there exists an element e in D(X, Y ) and Z T such that Z e = X e and Z \ e = X \ e. It follows that there exists z V (G) such that Z = L(z). Obviously, D(X, Z) = 1 and D(Z, Y ) = D(X, Y ) 1. Thus, d G (x, z) = 1, which means that {x, z} E(G). By induction, d G (z, y) = D(X, Y ) 1. It follows that d G (x, y) d G (x, z) + d G (z, y) = D(X, Y ) Now, the other direction is directly implied by Property 1 : D(L(x), L(y)). d G (x, y) Property 3. If (E, T ) is an acycloid and G its tope graph with associating bijection L : V (G) T, then for every vertex v in V (G) there exists only one vertex v in V (G) such that In particular, v is called antipode of v in G. d G (v, v) = diam(g) (5) Proof. Consider v V (G). By property (A2) of an acycloid, L(v) T. Let v be the vertex in V (G) such that L(v) = L( v). By Property 2 d G (v, v) = D(L(v), L( v)) = E which is the maximal distance between any vertices in V (G). Uniqueness follows by considering that the maximal distance is attanined only between two vertices whose separating set contain all the elements in E, and by remembering that the acycloid is simple. Now, we define a very useful object for the analysis of tope graphs. Definition 9. Let (E, T ) be an L 1 system and G its tope graph with associating bijection L : V (G) T. For e E we define the edge class of e as follows: E e := {{v, w} E(G) D(L(x), L(y)) = {e}} For an edge {v, w} E(G) we define: C(v, w) := {x V (G) d G (x, v) < d G (x, w)} We can show that edge classes are defined by the graph G itself, independently of L. Property 4. Let G be the tope graph of an L 1 system and L : V (G) T its associating bijection. Let {v, w} E(G) be an arbitrary edge in G, say {v, w} E e for some e E. Then: and C(v, w) = {x V (G) L(x)e = L(v) e } E e = {{v, w } E(G) v C(v, w) and w C(w, v)}. 5
6 Proof. For semplicity, let us denote V := L(v), W := L(w) and X := L(x), for an x V (G). By Property 2 d G (x, v) = D(X, V ) and d G (x, w) = D(X, W ). We know that x C(v, w) d G (x, v) < d G (x, w) D(X, V ) < D(X, W ) but this is true because {v, w} E e by hypothesis, i.e X e = V e = W e. Thus x C(v, w) if and only if X e = V e. We have proved the first statement. Now we need to prove that E e can be written as above. Let V := L(v ), W := L(w ) for some {v, w } in E(G). v C(v, w) V e = V e w C(w, v) W e = W e Thus, D(V, W ) = {e} implies that e D(V, W ), i.e {v, w } E e. On the other hand, after possibly intechanging V and W, which does not change the edge size since {v, w } = {w, v }, if e D(V, W ) then v C(v, w) and w C(w, v) which proves the second statement. Property 5 (Tope Graph of Oriented Matroids of Rank 2). The tope graph of an oriented matroid M = (E, F ) of rank 2 is a cycle of even length 2n, where n is the number of parallel classes in F/E 0, where E 0 is the set of loops. In order to prove this property, we need to recall the diamond property: Recall 2 (Diamond Property). Let M = (E, F ) be an oriented matroid and X, Y ˆF (big face lattice) such that X Y and rank M (Y ) rank M (X) = 2. Then there exists exactly two covectors Z 1, Z 2 F with the property that X Z i Y for i {1, 2}. Proof. Let M be an oriented matroid with rank(m) = 2, M = (E, F ), and let L : V (G) T be its associating bijection. Because rank(m) = 2 we know that 0 / T, (0 T means that 0 is an independent se but it is not). By symmetry of covectors: X T = X T thus, T = 2n for some integer n > 0. We also know now that the edges of G correspond to the cocircuits of the oriented matroid. By this and by the diamond property we can infer that the degree of every vertex is 2. This implies that G consists of a set of cycles and by property 2 G is connected. Thus, G has the form of a cycle of lenght 2n where n = diam(g) = E where E si the ground set of any simplification of M. By definition, E is equal to the number of parallel classes of non-loop elements. Remark 3. In tope graph of oriented matroids of rank 2 every edge class contains two edges which have opposite positions in the cycle. (Fig. 1) 6
7 Figure 2: Tope graph of an oriented matroid of rank 2 3 Property 5: Separability of Uncut Topes Definition 10. Let M = (E, F ) be a simple oriented matroid with tope set T, let f E arbitrary. Define: T := {Z T Z f = and f Z / T } T + := {Z T Zf = + and f Z / T } T 0 := {Z T f Z T } The sets T and T + are set of topes not cut or uncut by f. The motivation for this name comes from considering sphere arrangement and the deletion minor M \ f. If we insert a new sphere S f in the arrangement according to M \ f, then some of the regions of the minor remains unchanged and some are cut by S f into two different regions. The topes T corresponds to the uncut regions on the side of S f, T + to the uncut regions on the + side of S f and T 0 to the regions obtained by a cut. Theorem 1. Let M = (E, F ) be a simple oriented matroid with tope set T. Let f be an arbitrary element of E. Then, for every two topes X, Y T there exists a sequence X = Z 0,... Z k = Y such that Z i T for i {0,... k} and D(Z i 1, Z i ) = 1 for i {0,... k}. This theorem proves that the vertices in T are connected in the sense of adjacency in tope graphs. Of course, by symmetry it also holds for topes in T +. Before proving it, we state its main consequence: Remark 4. In order to see that Theorem 1 hols, the line arrangement has to be embedded on the front side of a sphere with a corresponding extension to the back side. Property 6. Let G be the tope graph of an oriented matroid M = (E, F ) and E f E(G) an edge class. Denote by V 0 the set of vertices incident to some edge in E f, then the subgraph of G induced by the vertices V (G) \ V 0 has either no or exactly two connected components. 7
8 Proof. Property 6 is an immediate consequence of Theorem 1. Let L : V (G) T {, +} E be the associating bijection of G. By definition of edge class there exists f E such that: L(V 0 ) = T 0 If T \ T 0 is the empty set, then there is nothing to prove. Thus, let T \ T 0. By T heorem1 this implies that there are exactly two connected components in the subgraph of G induced by the vertices V (G) \ V 0, one corresponding to T and one to T +. Definition 11 (Separable Tope Graph). Let G be the tope graph of an L 1 system and E f an edge calss in G. We say that G is separable w.r.t. E f if the separability holds for E f : the subgraph of G induced by the vertices V (G) \ V 0 has either no or exactly two connected components, where V 0 denotes the set of vertices incident to some edge in E f. We call G separable if G is separable w.r.t. all edge classes. Now, we can prove Theorem 1, but we need first to recall the definition of Oriented Matroid Program and some property of contraction minors. Recall 3 (Oriented Matroid Program). Let M = (E, F ) be an oriented matroid and f, g E two different elements. Let X, Z be sign vectors on E. The oriented matroid program OMP (M, g, f) is the problem to find an optimal sign vector X, which means finding a sign vector X which is feasible (i.e. X F and X \ f 0 and X g = +) and there is no augmenting direction for X. In particular, a sign vector Z is called an augmenting direction for X if Z is a direction (i.e. Z F and Z g = 0), Z \ f 0 and Z f = +. Recall 4. Let M = (E, F ) be an oriented matroid, E E, X F. Then: { rank(m) if e is a loop rank(m/e) = rank(m) rank M (e) = rank(m) 1 otherwise Recall 5 (Fundamental Theorem of OMP). Every oriented matroid program (M, g, f) is exactly one of optimal, unbounded or infeasible. Proof of Theorem 1. We prove the theorem just for T. The proof for T + is analogous by symmetry. The proof is by induction on the rank of the matroid M. Let r = rank(m). r < 2 then of course the proof is true; r = 2 then the result follow by Property 5 ; r 3. If T =, then there is nothing to prove. So assume T. Let X, Y T. Since X f = Y f = we have that X Y. Moreover, by the reorientation property (A1) in Definition 7 we know that: g D(X, Y ) = E \ D(X, Y ) s.t. g X T X T implies g f. By how we defined X and Y we know that X g = Y g 0. Without loss of generality we can assume X g = Y g = +. We need to consider now two different cases: either g Y T or g Y / T. 8
9 1. Let g Y T. Consider the contraction minor M/g, i.e. the contraction of M to faces which contain g in the zero support. M/g is an oriented mtroid, not necessarily simple, whose rank is rank(m) 1 by a property of contraction minors (see Recall 4 ). Let M be a simplification of M/g where the parallel class containing f is represented by f. Note that by definition, X \ g and Y \ g M/g and denote with X and Ỹ their images in M. Then X, Ỹ T where T is defined for M as T was defined for M. By inductive hypothesis there exists a sequence X = Ũ 0,..., Ũ k = Ỹ in T s.t. D(Ũ i 1, Ũ i ) = 1 for i {1,..., k} Consider now i {0,..., k}. Ũ i T implies that U i T s.t. U i g = + and g U i = T where Ũ i is the image of U i \ g in M. Moreover, Uf i =, and at most one between f U i and {f,g} U i is in T, it implies that at least one between U i and g U i is in T. We define { Û i U i if U := i T g U i otherwise, i.e if U i T Because Û 0 = X and Û k = Y, it only remains to show that Û i 1 and Û i are connected within T for all i {1,..., k} in the sense of the theorem. Consider now i {0,..., k}. By Property 2, there exists two sequences U i 1 = V 0,..., V d = U i and g U i 1 = W 0,..., W d = g U i with d = D(V j 1, V j ). Now we need again to distinguish two cases: If at least on of the two sequences lies entirely in T for i {0,..., k}, then the result follows (you just need to combine all these sequences in T ); Assume that for some i {0,..., k} none of the two sequences in entirely in T. This means that s, t {0,..., d} s.t. V := f V s T and W := f W t T. If we now apply covector elimination property to V, W and g we obtain Z F such that Z g = 0 and Z e = (V W ) e for e / D(V, W ), i.e. Z e = V e = W e for E / D(V, W ). In particular, Z f = +. 9
10 Note that D := D(U i 1, U i ) is a parallel class of M/g, thus Z D = 0, Z D = Û i 1 D, or Z D = Û D i. With also D(V, W ) D {g} it follows that Z Û i 1 = f Û i 1 T or Z Û i = f Û i T, which is a contradiction. 2. Let now g Y / T. We show that Y is connected to some Y in T in the sense of the theorem, then the result follows by part 1.. Because we know that reorientation does not affect connectedness within T by Lemma 1, without loss of generality we can assume Y e = + for all e E \ {f}. Consider now the oriented matroid program (M, g, f) (as in Recall 3 ). No unbounded augmenting direction Z F exists, otherwise we would have that Z Y = f Y T which is a contradiction. Because of this and also because Y is feasible for (M, g, f), by Recall 5 there exists an optimal solution U F for (M, g, f). Note that U \ f 0, U g = +, U f 0 because U f = + implies that U Y = f Y T. Let now: V := U Y T By Property 2, there exists a sequence Y = W 0,..., W d = V T s.t. D(W i 1, W i ) = 1 for i {1,..., d} where d = D(Y, V ). Because Y g = + and V g = U g =, there exists k {1,..., d} such that { Wg i + ifi < k = ifi = k Set now Y := W k 1, then g Y = W k T. It only remains to show that W i T for i {1,..., k 1}. Assume by contradiction that W i / T for some i {1,..., k 1}. This means that W T s.t. W \ f = W i \ f and W f = +. Now, apply the covector elimination to W, U and g. It results into the existence of Z F such that Z g = 0 and Z e = (W U) e for E / D(W, U). In particular, we obtain also that Z f = + and for all E f such that U e = 0, we have V e = Y e = +. So, also W e = + and Z e = W e = +. This means that Z is an augmenting direction for U, in contradiction to the optimatility of U. 10
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 informationDiskrete 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 informationFIVE-LIST-COLORING GRAPHS ON SURFACES II. A LINEAR BOUND FOR CRITICAL GRAPHS IN A DISK
FIVE-LIST-COLORING GRAPHS ON SURFACES II. A LINEAR BOUND FOR CRITICAL GRAPHS IN A DISK Luke Postle 1 Department of Combinatorics and Optimization University of Waterloo Waterloo, ON Canada N2L 3G1 and
More informationDirac s Map-Color Theorem for Choosability
Dirac s Map-Color Theorem for Choosability T. Böhme B. Mohar Technical University of Ilmenau, University of Ljubljana, D-98684 Ilmenau, Germany Jadranska 19, 1111 Ljubljana, Slovenia M. Stiebitz Technical
More informationOn a list-coloring problem
On a list-coloring problem Sylvain Gravier Frédéric Maffray Bojan Mohar December 24, 2002 Abstract We study the function f(g) defined for a graph G as the smallest integer k such that the join of G with
More information4 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 informationDistance between two k-sets and Path-Systems Extendibility
Distance between two k-sets and Path-Systems Extendibility December 2, 2003 Ronald J. Gould (Emory University), Thor C. Whalen (Metron, Inc.) Abstract Given a simple graph G on n vertices, let σ 2 (G)
More informationTOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS VII
TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS VII CAROLYN CHUN AND JAMES OXLEY Abstract. Let M be a 3-connected binary matroid; M is internally 4- connected if one side of every
More informationDiscrete Wiskunde II. Lecture 5: Shortest Paths & Spanning Trees
, 2009 Lecture 5: Shortest Paths & Spanning Trees University of Twente m.uetz@utwente.nl wwwhome.math.utwente.nl/~uetzm/dw/ Shortest Path Problem "#$%&'%()*%"()$#+,&- Given directed "#$%&'()*+,%+('-*.#/'01234564'.*,'7+"-%/8',&'5"4'84%#3
More informationON THE NUMBER OF COMPONENTS OF A GRAPH
Volume 5, Number 1, Pages 34 58 ISSN 1715-0868 ON THE NUMBER OF COMPONENTS OF A GRAPH HAMZA SI KADDOUR AND ELIAS TAHHAN BITTAR Abstract. Let G := (V, E be a simple graph; for I V we denote by l(i the number
More informationParity Versions of 2-Connectedness
Parity Versions of 2-Connectedness C. Little Institute of Fundamental Sciences Massey University Palmerston North, New Zealand c.little@massey.ac.nz A. Vince Department of Mathematics University of Florida
More informationSergey 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 informationMINIMALLY 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 informationarxiv: v1 [math.co] 7 Nov 2018
DP-4-COLORABILITY OF TWO CLASSES OF PLANAR GRAPHS LILY CHEN 1 AND RUNRUN LIU 2 AND GEXIN YU 2, AND REN ZHAO 1 AND XIANGQIAN ZHOU 1,4 arxiv:1811.02920v1 [math.co] Nov 2018 1 School of Mathematical Sciences,
More informationDiscrete Optimization 2010 Lecture 2 Matroids & Shortest Paths
Matroids Shortest Paths Discrete Optimization 2010 Lecture 2 Matroids & Shortest Paths Marc Uetz University of Twente m.uetz@utwente.nl Lecture 2: sheet 1 / 25 Marc Uetz Discrete Optimization Matroids
More informationStrongly 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 information4-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 informationA short course on matching theory, ECNU Shanghai, July 2011.
A short course on matching theory, ECNU Shanghai, July 2011. Sergey Norin LECTURE 3 Tight cuts, bricks and braces. 3.1. Outline of Lecture Ear decomposition of bipartite graphs. Tight cut decomposition.
More informationTOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS IV
TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS IV CAROLYN CHUN, DILLON MAYHEW, AND JAMES OXLEY Abstract. In our quest to find a splitter theorem for internally 4-connected binary
More information1 Some loose ends from last time
Cornell University, Fall 2010 CS 6820: Algorithms Lecture notes: Kruskal s and Borůvka s MST algorithms September 20, 2010 1 Some loose ends from last time 1.1 A lemma concerning greedy algorithms and
More informationRigidity of Graphs and Frameworks
Rigidity of Graphs and Frameworks Rigid Frameworks The Rigidity Matrix and the Rigidity Matroid Infinitesimally Rigid Frameworks Rigid Graphs Rigidity in R d, d = 1,2 Global Rigidity in R d, d = 1,2 1
More informationTOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS II
TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS II CAROLYN CHUN, DILLON MAYHEW, AND JAMES OXLEY Abstract. Let M and N be internally 4-connected binary matroids such that M has a proper
More informationGraph Theorizing Peg Solitaire. D. Paul Hoilman East Tennessee State University
Graph Theorizing Peg Solitaire D. Paul Hoilman East Tennessee State University December 7, 00 Contents INTRODUCTION SIMPLE SOLVING CONCEPTS 5 IMPROVED SOLVING 7 4 RELATED GAMES 5 5 PROGENATION OF SOLVABLE
More informationUsing Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems
Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems Jan van den Heuvel and Snežana Pejić Department of Mathematics London School of Economics Houghton Street,
More informationHypercube Coloring and the Structure of Binary Codes
Hypercube Coloring and the Structure of Binary Codes by James Gregory Rix A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE in The College of Graduate Studies
More informationLehrstuhl für Mathematische Grundlagen der Informatik
Lehrstuhl für Mathematische Grundlagen der Informatik W. Hochstättler, J. Nešetřil: Antisymmetric Flows in Matroids Technical Report btu-lsgdi-006.03 Contact: wh@math.tu-cottbus.de,nesetril@kam.mff.cuni.cz
More informationAn approximate version of Hadwiger s conjecture for claw-free graphs
An approximate version of Hadwiger s conjecture for claw-free graphs Maria Chudnovsky Columbia University, New York, NY 10027, USA and Alexandra Ovetsky Fradkin Princeton University, Princeton, NJ 08544,
More informationMulti-coloring and Mycielski s construction
Multi-coloring and Mycielski s construction Tim Meagher Fall 2010 Abstract We consider a number of related results taken from two papers one by W. Lin [1], and the other D. C. Fisher[2]. These articles
More informationGraphic sequences, adjacency matrix
Chapter 2 Graphic sequences, adjacency matrix Definition 2.1. A sequence of integers (d 1,..., d n ) is called graphic if it is the degree sequence of a graph. Example 2.2. 1. (1, 2, 2, 3) is graphic:
More informationGRAPHIC REALIZATIONS OF SEQUENCES. Under the direction of Dr. John S. Caughman
GRAPHIC REALIZATIONS OF SEQUENCES JOSEPH RICHARDS Under the direction of Dr. John S. Caughman A Math 501 Project Submitted in partial fulfillment of the requirements for the degree of Master of Science
More informationCompatible Circuit Decompositions of 4-Regular Graphs
Compatible Circuit Decompositions of 4-Regular Graphs Herbert Fleischner, François Genest and Bill Jackson Abstract A transition system T of an Eulerian graph G is a family of partitions of the edges incident
More informationarxiv: v1 [math.co] 19 Aug 2016
THE EXCHANGE GRAPHS OF WEAKLY SEPARATED COLLECTIONS MEENA JAGADEESAN arxiv:1608.05723v1 [math.co] 19 Aug 2016 Abstract. Weakly separated collections arise in the cluster algebra derived from the Plücker
More informationPath decompositions and Gallai s conjecture
Journal of Combinatorial Theory, Series B 93 (005) 117 15 www.elsevier.com/locate/jctb Path decompositions and Gallai s conjecture Genghua Fan Department of Mathematics, Fuzhou University, Fuzhou, Fujian
More informationarxiv: v1 [math.co] 25 Dec 2017
Planar graphs without -cycles adjacent to triangles are DP--colorable Seog-Jin Kim and Xiaowei Yu arxiv:1712.08999v1 [math.co] 25 Dec 2017 December 27, 2017 Abstract DP-coloring (also known as correspondence
More informationA note on the acyclic 3-choosability of some planar graphs
A note on the acyclic 3-choosability of some planar graphs Hervé Hocquard, Mickael Montassier, André Raspaud To cite this version: Hervé Hocquard, Mickael Montassier, André Raspaud. A note on the acyclic
More informationPolynomials in graph theory
Polynomials in graph theory Alexey Bogatov Department of Software Engineering Faculty of Mathematics and Mechanics Saint Petersburg State University JASS 2007 Saint Petersburg Course 1: Polynomials: Their
More informationTrees. A tree is a graph which is. (a) Connected and. (b) has no cycles (acyclic).
Trees A tree is a graph which is (a) Connected and (b) has no cycles (acyclic). 1 Lemma 1 Let the components of G be C 1, C 2,..., C r, Suppose e = (u, v) / E, u C i, v C j. (a) i = j ω(g + e) = ω(g).
More information1 Matroid intersection
CS 369P: Polyhedral techniques in combinatorial optimization Instructor: Jan Vondrák Lecture date: October 21st, 2010 Scribe: Bernd Bandemer 1 Matroid intersection Given two matroids M 1 = (E, I 1 ) and
More informationGraph Theory. Thomas Bloom. February 6, 2015
Graph Theory Thomas Bloom February 6, 2015 1 Lecture 1 Introduction A graph (for the purposes of these lectures) is a finite set of vertices, some of which are connected by a single edge. Most importantly,
More informationUpper Bounds of Dynamic Chromatic Number
Upper Bounds of Dynamic Chromatic Number Hong-Jian Lai, Bruce Montgomery and Hoifung Poon Department of Mathematics West Virginia University, Morgantown, WV 26506-6310 June 22, 2000 Abstract A proper vertex
More information12.1 The Achromatic Number of a Graph
Chapter 1 Complete Colorings The proper vertex colorings of a graph G in which we are most interested are those that use the smallest number of colors These are, of course, the χ(g)-colorings of G If χ(g)
More informationMarkov properties for undirected graphs
Graphical Models, Lecture 2, Michaelmas Term 2011 October 12, 2011 Formal definition Fundamental properties Random variables X and Y are conditionally independent given the random variable Z if L(X Y,
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 159 (2011) 1345 1351 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam On disconnected cuts and separators
More informationDiskrete Mathematik und Optimierung
Diskrete Mathematik und Optimierung Winfried Hochstättler: Towards a flow theory for the dichromatic number Technical Report feu-dmo032.14 Contact: winfried.hochstaettler@fernuni-hagen.de FernUniversität
More informationDisjoint Hamiltonian Cycles in Bipartite Graphs
Disjoint Hamiltonian Cycles in Bipartite Graphs Michael Ferrara 1, Ronald Gould 1, Gerard Tansey 1 Thor Whalen Abstract Let G = (X, Y ) be a bipartite graph and define σ (G) = min{d(x) + d(y) : xy / E(G),
More informationExact Algorithms for Dominating Induced Matching Based on Graph Partition
Exact Algorithms for Dominating Induced Matching Based on Graph Partition Mingyu Xiao School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731,
More informationMINIMALLY 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 informationHamilton 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 information1.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 informationBreadth-First Search of Graphs
Breadth-First Search of Graphs Analysis of Algorithms Prepared by John Reif, Ph.D. Distinguished Professor of Computer Science Duke University Applications of Breadth-First Search of Graphs a) Single Source
More informationDense near octagons with four points on each line, III
Dense near octagons with four points on each line, III Bart De Bruyn Ghent University, Department of Pure Mathematics and Computer Algebra, Krijgslaan 281 (S22), B-9000 Gent, Belgium, E-mail: bdb@cage.ugent.be
More informationOn the reconstruction of the degree sequence
Discrete Mathematics 259 (2002) 293 300 www.elsevier.com/locate/disc Note On the reconstruction of the degree sequence Charles Delorme a, Odile Favaron a, Dieter Rautenbach b;c; ;1 a LRI, Bât. 490, Universite
More informationCycles in 4-Connected Planar Graphs
Cycles in 4-Connected Planar Graphs Guantao Chen Department of Mathematics & Statistics Georgia State University Atlanta, GA 30303 matgcc@panther.gsu.edu Genghua Fan Institute of Systems Science Chinese
More informationAdvanced 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 informationEfficient Reassembling of Graphs, Part 1: The Linear Case
Efficient Reassembling of Graphs, Part 1: The Linear Case Assaf Kfoury Boston University Saber Mirzaei Boston University Abstract The reassembling of a simple connected graph G = (V, E) is an abstraction
More informationHW Graph Theory SOLUTIONS (hbovik) - Q
1, Diestel 3.5: Deduce the k = 2 case of Menger s theorem (3.3.1) from Proposition 3.1.1. Let G be 2-connected, and let A and B be 2-sets. We handle some special cases (thus later in the induction if these
More informationEulerian Subgraphs in Graphs with Short Cycles
Eulerian Subgraphs in Graphs with Short Cycles Paul A. Catlin Hong-Jian Lai Abstract P. Paulraja recently showed that if every edge of a graph G lies in a cycle of length at most 5 and if G has no induced
More informationDiscrete Mathematics
Discrete Mathematics 09 (2009) 49 502 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc 2-distance ( + 2)-coloring of planar graphs with girth
More informationA Topological Representation Theorem for Oriented Matroids
Smith ScholarWorks Computer Science: Faculty Publications Computer Science 4-2005 A Topological Representation Theorem for Oriented Matroids Jürgen Bokowski Technische Universitat Darmstadt Simon King
More informationRao 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 informationPlanar 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 informationHyperplanes of Hermitian dual polar spaces of rank 3 containing a quad
Hyperplanes of Hermitian dual polar spaces of rank 3 containing a quad Bart De Bruyn Ghent University, Department of Mathematics, Krijgslaan 281 (S22), B-9000 Gent, Belgium, E-mail: bdb@cage.ugent.be Abstract
More informationk-blocks: a connectivity invariant for graphs
1 k-blocks: a connectivity invariant for graphs J. Carmesin R. Diestel M. Hamann F. Hundertmark June 17, 2014 Abstract A k-block in a graph G is a maximal set of at least k vertices no two of which can
More informationNowhere 0 mod p dominating sets in multigraphs
Nowhere 0 mod p dominating sets in multigraphs Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel. e-mail: raphy@research.haifa.ac.il Abstract Let G be a graph with
More informationSmall Label Classes in 2-Distinguishing Labelings
Also available at http://amc.imfm.si ISSN 1855-3966 (printed ed.), ISSN 1855-3974 (electronic ed.) ARS MATHEMATICA CONTEMPORANEA 1 (2008) 154 164 Small Label Classes in 2-Distinguishing Labelings Debra
More information25 Minimum bandwidth: Approximation via volume respecting embeddings
25 Minimum bandwidth: Approximation via volume respecting embeddings We continue the study of Volume respecting embeddings. In the last lecture, we motivated the use of volume respecting embeddings by
More informationThe L 3 (4) near octagon
The L 3 (4) near octagon A. Bishnoi and B. De Bruyn October 8, 206 Abstract In recent work we constructed two new near octagons, one related to the finite simple group G 2 (4) and another one as a sub-near-octagon
More informationarxiv: v1 [math.co] 20 Oct 2018
Total mixed domination in graphs 1 Farshad Kazemnejad, 2 Adel P. Kazemi and 3 Somayeh Moradi 1,2 Department of Mathematics, University of Mohaghegh Ardabili, P.O. Box 5619911367, Ardabil, Iran. 1 Email:
More informationDiskrete Mathematik und Optimierung
Diskrete Mathematik und Optimierung Winfried Hochstättler, Robert Nickel: Joins of Oriented Matroids Technical Report feu-dmo009.07 Contact: winfried.hochstaettler@fernuni-hagen.de robert.nickel@fernuni-hagen.de
More informationAn Introduction of Tutte Polynomial
An Introduction of Tutte Polynomial Bo Lin December 12, 2013 Abstract Tutte polynomial, defined for matroids and graphs, has the important property that any multiplicative graph invariant with a deletion
More information{2, 2}-Extendability of Planar Graphs
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 6, Issue 6 (March 2013), PP. 61-66 {2, 2}-Extendability of Planar Graphs Dharmaiah
More informationThe Computational Complexity of Graph Contractions I: Polynomially Solvable and NP-Complete Cases*
The Computational Complexity of Graph Contractions I: Polynomially Solvable and NP-Complete Cases* Asaf Levin Department of Statistics, The Hebrew University, Jerusalem 91905, Israel Daniel Paulusma Department
More information3-choosability of triangle-free planar graphs with constraints on 4-cycles
3-choosability of triangle-free planar graphs with constraints on 4-cycles Zdeněk Dvořák Bernard Lidický Riste Škrekovski Abstract A graph is k-choosable if it can be colored whenever every vertex has
More informationTHE MINIMALLY NON-IDEAL BINARY CLUTTERS WITH A TRIANGLE 1. INTRODUCTION
THE MINIMALLY NON-IDEAL BINARY CLUTTERS WITH A TRIANGLE AHMAD ABDI AND BERTRAND GUENIN ABSTRACT. It is proved that the lines of the Fano plane and the odd circuits of K 5 constitute the only minimally
More informationOn zero sum-partition of Abelian groups into three sets and group distance magic labeling
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 13 (2017) 417 425 On zero sum-partition of Abelian groups into three
More informationRegular matroids without disjoint circuits
Regular matroids without disjoint circuits Suohai Fan, Hong-Jian Lai, Yehong Shao, Hehui Wu and Ju Zhou June 29, 2006 Abstract A cosimple regular matroid M does not have disjoint circuits if and only if
More informationImprimitive symmetric graphs with cyclic blocks
Imprimitive symmetric graphs with cyclic blocks Sanming Zhou Department of Mathematics and Statistics University of Melbourne Joint work with Cai Heng Li and Cheryl E. Praeger December 17, 2008 Outline
More information3-choosability of triangle-free planar graphs with constraint on 4-cycles
3-choosability of triangle-free planar graphs with constraint on 4-cycles Zdeněk Dvořák Bernard Lidický Riste Škrekovski Abstract A graph is k-choosable if it can be colored whenever every vertex has a
More informationDISTRIBUTIVE LATTICES ON GRAPH ORIENTATIONS
DISTRIBUTIVE LATTICES ON GRAPH ORIENTATIONS KOLJA B. KNAUER ABSTRACT. Propp gave a construction method for distributive lattices on a class of orientations of a graph called c-orientations. Given a distributive
More informationTOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS III
TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS III CAROLYN CHUN, DILLON MAYHEW, AND JAMES OXLEY Abstract. This paper proves a preliminary step towards a splitter theorem for internally
More informationA necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of
More informationThe minimum G c cut problem
The minimum G c cut problem Abstract In this paper we define and study the G c -cut problem. Given a complete undirected graph G = (V ; E) with V = n, edge weighted by w(v i, v j ) 0 and an undirected
More informationSpanning 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 informationFour-coloring P 6 -free graphs. I. Extending an excellent precoloring
Four-coloring P 6 -free graphs. I. Extending an excellent precoloring Maria Chudnovsky Princeton University, Princeton, NJ 08544 Sophie Spirkl Princeton University, Princeton, NJ 08544 Mingxian Zhong Columbia
More informationChordal Coxeter Groups
arxiv:math/0607301v1 [math.gr] 12 Jul 2006 Chordal Coxeter Groups John Ratcliffe and Steven Tschantz Mathematics Department, Vanderbilt University, Nashville TN 37240, USA Abstract: A solution of the isomorphism
More informationδ-hyperbolic SPACES SIDDHARTHA GADGIL
δ-hyperbolic SPACES SIDDHARTHA GADGIL Abstract. These are notes for the Chennai TMGT conference on δ-hyperbolic spaces corresponding to chapter III.H in the book of Bridson and Haefliger. When viewed from
More informationAn upper bound on the domination number of n-vertex connected cubic graphs
Discrete Mathematics 309 (2009) 1142 1162 www.elsevier.com/locate/disc An upper bound on the domination number of n-vertex connected cubic graphs A.V. Kostochka a,b,, B.Y. Stodolsky a a Department of Mathematics,
More informationCS281A/Stat241A Lecture 19
CS281A/Stat241A Lecture 19 p. 1/4 CS281A/Stat241A Lecture 19 Junction Tree Algorithm Peter Bartlett CS281A/Stat241A Lecture 19 p. 2/4 Announcements My office hours: Tuesday Nov 3 (today), 1-2pm, in 723
More informationMATROID PACKING AND COVERING WITH CIRCUITS THROUGH AN ELEMENT
MATROID PACKING AND COVERING WITH CIRCUITS THROUGH AN ELEMENT MANOEL LEMOS AND JAMES OXLEY Abstract. In 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the maximum
More informationLong Cycles in 3-Connected Graphs
Long Cycles in 3-Connected Graphs Guantao Chen Department of Mathematics & Statistics Georgia State University Atlanta, GA 30303 Xingxing Yu School of Mathematics Georgia Institute of Technology Atlanta,
More information3-CHOOSABILITY OF TRIANGLE-FREE PLANAR GRAPHS WITH CONSTRAINT ON 4-CYCLES
University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics Jadranska 19, 1000 Ljubljana, Slovenia Preprint series, Vol. 47 (2009), 1080 3-CHOOSABILITY OF TRIANGLE-FREE
More informationACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex
More informationCompatible Circuit Decompositions of Eulerian Graphs
Compatible Circuit Decompositions of Eulerian Graphs Herbert Fleischner, François Genest and Bill Jackson Septemeber 5, 2006 1 Introduction Let G = (V, E) be an Eulerian graph. Given a bipartition (X,
More informationarxiv: v3 [math.co] 18 Jul 2014
Cop and robber game and hyperbolicity Jérémie Chalopin 1, Victor Chepoi 1, Panos Papasoglu 2, and Timothée Pecatte 3 arxiv:1308.3987v3 [math.co] 18 Jul 2014 1 Laboratoire d Informatique Fondamentale, Aix-Marseille
More informationStandard Diraphs the (unique) digraph with no vertices or edges. (modulo n) for every 1 i n A digraph whose underlying graph is a complete graph.
5 Directed Graphs What is a directed graph? Directed Graph: A directed graph, or digraph, D, consists of a set of vertices V (D), a set of edges E(D), and a function which assigns each edge e an ordered
More informationList-coloring the Square of a Subcubic Graph
List-coloring the Square of a Subcubic Graph Daniel W. Cranston University of Illinois Urbana-Champaign, USA Seog-Jin Kim Konkuk University Seoul, Korea February 1, 2007 Abstract The square G 2 of a graph
More informationConnectivity and tree structure in finite graphs arxiv: v5 [math.co] 1 Sep 2014
Connectivity and tree structure in finite graphs arxiv:1105.1611v5 [math.co] 1 Sep 2014 J. Carmesin R. Diestel F. Hundertmark M. Stein 20 March, 2013 Abstract Considering systems of separations in a graph
More informationUnless otherwise specified, V denotes an arbitrary finite-dimensional vector space.
MAT 90 // 0 points Exam Solutions Unless otherwise specified, V denotes an arbitrary finite-dimensional vector space..(0) Prove: a central arrangement A in V is essential if and only if the dual projective
More informationarxiv: v1 [cs.dm] 12 Jun 2016
A Simple Extension of Dirac s Theorem on Hamiltonicity Yasemin Büyükçolak a,, Didem Gözüpek b, Sibel Özkana, Mordechai Shalom c,d,1 a Department of Mathematics, Gebze Technical University, Kocaeli, Turkey
More informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More information