Coloring Vertices and Edges of a Path by Nonempty Subsets of a Set
|
|
- Lester Arnold
- 6 years ago
- Views:
Transcription
1 Coloring Vertices and Edges of a Path by Nonempty Subsets of a Set P.N. Balister E. Győri R.H. Schelp April 28, 28 Abstract A graph G is strongly set colorable if V (G) E(G) can be assigned distinct nonempty subsets of a set of order n, where V (G) + E(G) = 2 n, such that each edge is assigned the symmetric difference of its end vertices. The principal result is that the path P 2 n is strongly set colorable for n 5, disproving a conjecture of S.M. Hegde. We also prove another conjecture of S.M. Hegde on a related type of set coloring of complete bipartite graphs. Introduction In a recent article by Hedge [], he considered coloring certain graphs G, where V (G) + E(G) = 2 n for some integer n, by nonempty subsets of an n-element set. One primary assignment considered was to assign distinct subsets to the vertices and edges such that each edge is assigned the symmetric difference of its end vertices. Since V (G) + E(G) = 2 n this means all nonempty subsets are used in the assignment. When such an assignment exists it is called a strong set coloring of the graph. One interesting conjecture made in this article was that paths of order 2 n where n > 2 are not strongly set colorable. The primary purpose of this article is to disprove this conjecture for n 5. We prove the following theorem. Theorem The paths P 4 and P 8 are not strongly set colorable while all other paths of the form P 2 n are strongly set colorable. An equivalent formulation for a graph to be strongly set colorable and one used throughout this article is the following one. Let G be a connected graph such that V (G) + E(G) = 2 n for some n. We say that G is strongly set colorable if there is a bijection f from V (G) E(G) to the set of nonzero vectors in F n 2, where F 2 is the field with two elements,
2 such that for every edge xy E(G), f(xy)+f(x)+f(y) =. We regard vectors in F n 2 as - sequences of length n, addition in F n 2 corresponding to componentwise addition modulo 2. The vector v then corresponds to the subset S v {, 2,..., n}, where S v consists of all i such that the ith coordinate of v is. In this language the Hedge conjecture says there is no permutation v, v 2, v 3,..., v 2 n of the n-dimensional nonzero vectors of F n 2 such that v i + v i+ + v i+2 = for i =, 3, 5,..., 2 n 3. Here v i represents the set coloring of a vertex when i is odd and of an edge when i is even. These conditions will be referred to as sum conditions. When a permutation satisfying the sum conditions exists we will refer to it as representing vectors in a good permutation or more briefly as a good permutation. In the sequel we also briefly discuss some other trees which are strongly set colorable and give a related condition which is of interest in its own right. 2 Results Lemma 2 The paths P 4 and P 8 of orders 4 and 8 are not strongly set colorable. Proof. First consider the path P 4 and suppose there is a good permutation of its representing vectors v,..., v 7. Since for all n > the sum of all the non-zero vectors in F n 2 is zero, v + v 2 + v 3 + v 4 + v 5 + v 6 + v 7 =. By the sum condition both v + v 2 + v 3 = and v 5 + v 6 + v 7 =, so we have v 4 =, a contradiction. Therefore P 4 is not strongly set colorable. Next consider the path P 8. Suppose that there is a good permutation v,..., v 5 of the representing vectors satisfying the sum conditions. First notice that 5 v 4 + v 8 + v 2 = v i (v +v 2 +v 3 ) (v 5 +v 6 +v 7 ) (v 9 +v +v ) (v 3 +v 4 +v 5 ) i= = =. Claim: The vectors v 5, v 6, v 7, v 9, v, v, v 3, v 4, v 5 can be written in the form v i + v 4j where i, j =, 2, 3. We call the forms of these 9 vectors canonical. Proof of Claim. First we show that these 9 vectors are different from v, v 2, v 3, v 4, v 8, v 2. Suppose that v i = v i2 + v 4j2. Then adding v i2 to this vector, we obtain that either v 4j2 = if i = i 2 or v 4j2 is the third vector out of v, v 2, v 3 if i i 2, a contradiction in both cases. Likewise v 4i v i2 + v 4j2, otherwise v i2 = or the third vector of v 4, v 8, v 2. Then, by pigeonhole principle, it is sufficient to prove that these 9 vectors are pairwise distinct. Suppose that v i + v 4j = v i2 + v 4j2. If i = i 2, j j 2, then it follows that v 4j = v 4j2, a contradiction. If i i 2 then let i 3 be the third index out of, 2, 3. Then v i3 = v i + v i2 = v 4j + v 4j2, which is either if j = j 2 or the third vector out of v 4, v 8, v 2 if j j 2, a contradiction, completing the proof of this claim. 2
3 Define the sets B = {v 5, v 6, v 7 }, B 2 = {v 9, v, v }, B 3 = {v 3, v 4, v 5 } as blocks. Claim: For each block, the vectors v, v 2, v 3, v 4, v 8, v 2 appear exactly once in canonical form of the vectors in the block. Proof of Claim. Let w, w 2, w 3 be the vectors in the block, and suppose that, say, v i appears in the canonical form of w and w 2, i.e., w = v i + v 4j and w 2 = v i + v 4j2 where j j 2 since w w 2. Then w 3 = w + w 2 = v 4j + v 4j2 = v 4j3 where v 4j3 is the third vector in {v 4, v 8, v 2 }, a contradiction. The case when v 4j appears twice can be settled similarly. Having established the above claims we complete the proof of the theorem. Observe that v 5 = v 3 + v 4 by the sum condition. If the canonical form of v 7 contains v 8 then the sum condition implies that v 9 is an element of v, v 2, v 3, a contradiction. So v 7 has v 2 in its canonical form, and since we have symmetry in v and v 2, we may assume that v 7 = v + v 2 (and so v 6 = v 2 + v 8 ). Then v 9 = v + v 4 by the sum condition. As above, v cannot have v 2 in its canonical form, and of course, cannot be v 6 = v 2 + v 8. Thus v = v 3 + v 8, since if v = v + v 8 then v 2 + v = v + v 4 = v 9 = v 3, a contradiction. Then by the sum condition, v 3 = v 3 + v 4 = v 5, a final contradiction, completing the proof of the theorem. Lemma 3 The path P 2 n of order 2 n is strongly set colorable for n = 2 and n 5. Proof. The result is clear for n = 2 so we assume n 5. The proof is inductive applying the induction separately for n odd and for n even. The idea of the proof is to take four copies of a path P which has been strongly set colored and extend this fixed coloring to a path of order 4 P. This involves three basic operations. First, each of the - vectors of the fixed path using n coordinates is increased to one using n + 2 coordinates by adding two new - coordinates such that the resulting vector is distinguished in each of the four copies of this path. Secondly, the four copies are laid end to end with the order of the second and fourth copies reversed from the first and third. Lastly, three new vectors each with zeros in the first n coordinates and differing only in at least one of the last two - coordinates are inserted between the first path and the second, the second and the third, and the third and the fourth. In order to accomplish what has just been described in a precise formal way we first introduce some notation. If v is an n-dimensional vector (- sequence) then v and v are the (n+)- dimensional vectors obtained from v by extending it with a coordinate and, respectively. Similarly, say, v is the (n + 2)-dimensional vector obtained from v by extending it with two coordinates. To avoid confusion, the n-dimensional zero vector will be denoted by n. Figure shows that there are good permutations for both n = 5 and n = 6. It is easy to verify the correctness of these examples. These examples will anchor the inductive proof that we give separately for n odd and for n even. 3
4 .... Figure : Example set colorings of path P 2 n for n = 5 and n = 6, sets given as - sequences for each edge and vertex. To finish the proof of the theorem, we prove for that if P 2 n is strongly set colorable for n 5 then P 2 n+ is strongly set colorable. Thus assume that v, v 2,..., v 2 n is a desired good permutation of the n-dimensional nonzero - vectors. Then it is a somewhat tedious, but straightforward to verify that the following sequence is a desired permutation of the (n + 2)-dimensional nonzero vectors satisfying the sum conditions. (The extension is 4-periodic in the blocks of 2 n vectors but requires certain interchanges of the first or last two vectors to fulfill the sum conditions). We provide the lengthy sequence to clarify the desired resulting good permutation. (Vectors written vertically, bold entries indicate entries that do not fit into the 4-periodic pattern.) v v 2 v 3 v 4 v 5 v 6 v 7... v 2 n 8 v 2 n 7 v 2 n 6 v 2 n 5 v 2 n 4 v 2 n 3 v 2 n 2 v 2 n n v 2 n v 2 n 2 v 2 n 3 v 2 n 4 v 2 n 5 v 2 n 6 v 2 n 7... v 8 v 7 v 6 v 5 v 4 v 3 v v 2 n v 2 v v 3 v 4 v 5 v 6 v 7... v 2 n 8 v 2 n 7 v 2 n 6 v 2 n 5 v 2 n 4 v 2 n 3v 2 n v 2 n 2 n v 2 n 2v 2 n v 2 n 3 v 2 n 4 v 2 n 5 v 2 n 6 v 2 n 7... v 8 v 7 v 6 v 5 v 4 v 3 v 2 v This completes the inductive step and the proof of the theorem. The reader should note that the interchanges required in the constructed sequence in the proof just given makes this construction fail for n = 2, so that P 2 strongly set colorable does not imply P 8 is strongly set colorable. The general strategy used in the proof of the last theorem can be applied beginning with a strongly set colorable bipartite graph in place of a path. The interchange idea is not needed in this case. 4
5 Theorem 4 Let G be a strongly set colorable bipartite graph with color classes X, Y and edge set E. Let G, G 2, G 3, G 4 be four disjoint copies of G with color classes X, Y, X 2, Y 2, X 3, Y 3, X 4, Y 4 and edge sets E, E 2, E 3, E 3, respectively. Let G denote the graph obtained from the disjoint union of the graphs G, G 2, G 3, G 4 by adding edges e, e 2, e 2 with the following properties:. each e i joins two copies of the same vertex; 2. one of the following three possibilities occurs: (a) the edges join X and X 2, X and X 3, X and X 4, respectively; or (b) the edges join X and X 2, X 2 and X 3, Y 3 and Y 4, respectively; or (c) the edges join X and X 2, Y 2 and Y 4, Y and Y 3, respectively. Then G is strongly set colorable. Proof. Consider the same vector coloring of G, G 2, G 3 and G 4. Then extend the vectors in X, Y, and E with, the vectors in X 3, Y 4, and E 2 with, the vectors in X 2, Y 3, and E 4 with, the vectors in X 4, Y 2, and E 3 with. If we color the edges e, e 2, e 3 according to the sum condition, then it is easy to verify that we obtain a desired vector coloring of G, completing the proof. Symmetric possibilities of those listed in the last theorem are clearly strongly set colorable as well. 3 Other Trees The binary tree has a particularly nice set coloring. To ensure that we have exactly 2 n vertices, we add one additional leaf to the root of the tree. The coloring is then given at each level by assigning vertices the binary numbers from 2 l+ to 3.2 l in turn, see Figure 2. The edges the are colored with the numbers 3.2 l to 2 l+2 in the order of a grey code. Another interesting possible construction is to take a strong set coloring of G and extend it to a new graph G obtained from G by adding 2 n pending edges. The color of each of the original edges and vertices of G is obtained by appending to the original color. New edges e i get color p i and new vertices u i get color q i where the pendent edge e i = u i v i is joined to a vertex v i of color v i. We need v i = p i q i for this to give a strong coloring of G, and the set of all p i and q i needs to exhaust F n 2. Note that some of the v i s may be the same since we can attach several pendent edges to the same vertex. We need v i = for such p i and q i to exist (since = p i + q i = v i ). It appears that this is sufficient, so we make the following conjecture. 5
6 Figure 2: Coloring of the binary tree. All - sequences should be padded on the left by the appropriate number of zeros. Conjecture Given 2 n non-zero (not necessarily distinct) vectors v,..., v 2 n F n 2, n 2, with 2 n i= v i =, there exists a partition of F n 2 into pairs of vectors {p i, q i }, i =,..., 2 n such that for all i, v i = p i q i. This conjecture, which appears to be of interest in its own right, is true for n 5. It is also true if at least half of all the vectors v i are the same and all vectors occur an even number of times. Theorem 5 Given 2 n non-zero vectors v,..., v 2 n F n 2, n 2, with v = v 2 = = v 2 n 2, v 2i = v 2i+ for all i and 2 n i= v i =, there exists a partition of F n 2 into pairs of vectors {p i, q i }, i =,..., 2 n such that for all i, v i = p i q i. Proof. 4 Proper set colorings of complete bipartite graphs In [], a proper set coloring of a graph G is defined as an assignment of subsets of an n-element set to the vertices and edges of G so that. each edge receives the symmetric difference of the sets assigned to its end vertices; 2. distinct vertices receive distinct sets; 3. distinct edges receive distinct non-empty sets; and 4. every non-empty set appears on some edge. 6
7 Note that the same set can occur on both an edge and a vertex. Clearly, if a proper set coloring of G is to exists we need E(G) = 2 n. The following theorem appears as a conjecture in []. Theorem 6 If the complete bipartite graph K s,t has a proper set coloring then either s = or t =. Writing S,..., S s and T,..., T t as the sets assigned to the vertices of K s,t, this theorem is an immediate consequence of the following. Theorem 7 Assume S,..., S s and T,..., T t are subsets of {,..., n} and the symmetric differences S i T j, i =,..., s, j =,..., t, are non-empty and represent every non-empty subset of {,..., n} exactly once (so in particular st = 2 n ). Then either s = or t =. Proof. Consider for any X {,..., n} the quantities ŜX = s i= ( ) X S i and ˆT X = t j= ( ) X Tj. (These are Fourier transforms over F n 2 of the indicator functions giving the sets S i and T j respectively.) Now Ŝ X ˆTX = i,j ( ) X S i + X T j = Y ( ) X Y since X S i + X T j X (S i T j ) mod 2 and the S i T j range over all nonempty subsets of {,..., n}. Now if X, then the number of (possibly empty) subsets Y {,..., n} with X Y is even is the same as the number with X Y odd. Indeed, if k X we can pair up the sets Y with k / Y with Y = Y {k} and then X Y and X Y have different parities. Thus Ŝ X ˆTX = ( ) Y ( ) X Y = ( ) X Y ( ) X = =. But ŜX, ˆT X Z, so ŜX, ˆT X {, } for X. Now consider ŜX 2 = Ŝ2 + ŜX 2 = s 2 + (2 n ).. X X Y We can also write this as ŜX 2 = X X s s ( ) X Si ( ) X Sj = ( ) X (S i S j ). i,j= i,j= X But the last sum over X is zero unless S i S j =, i.e., unless S i = S j. But if S i = S j then S i T = S j T, so i = j since the S k T l are distinct. Hence ŜX 2 = X s ( ) X = 2 n s. i= X 7
8 (This is just a special case of Parseval s theorem for Fourier transforms.) Thus 2 n s = s 2 + (2 n ) and so (s )(s (2 n )) = s 2 2 n s + (2 n ) =. Hence either s =, or s = 2 n. But if s = 2 n then t = since st = 2 n. References [] S.M. Hegde, Set Colorings of Graphs, preprint. 8
Coloring Vertices and Edges of a Path by Nonempty Subsets of a Set
Coloring Vertices and Edges of a Path by Nonempty Subsets of a Set P.N. Balister E. Győri R.H. Schelp November 8, 28 Abstract A graph G is strongly set colorable if V (G) E(G) can be assigned distinct
More informationK 4 -free graphs with no odd holes
K 4 -free graphs with no odd holes Maria Chudnovsky 1 Columbia University, New York NY 10027 Neil Robertson 2 Ohio State University, Columbus, Ohio 43210 Paul Seymour 3 Princeton University, Princeton
More informationMATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017
MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A
More informationGeneralized 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 informationOn the number of cycles in a graph with restricted cycle lengths
On the number of cycles in a graph with restricted cycle lengths Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós arxiv:1610.03476v1 [math.co] 11 Oct 2016 October 12, 2016 Abstract Let L be a
More informationRamsey Unsaturated and Saturated Graphs
Ramsey Unsaturated and Saturated Graphs P Balister J Lehel RH Schelp March 20, 2005 Abstract A graph is Ramsey unsaturated if there exists a proper supergraph of the same order with the same Ramsey number,
More informationNeighbor-distinguishing k-tuple edge-colorings of graphs
Neighbor-distinguishing k-tuple edge-colorings of graphs Jean-Luc Baril and Olivier Togni 1 LEI UMR-CNRS 5158, Université de Bourgogne B.P. 7 870, 1078 DIJON-Cedex France e-mail: {barjl,olivier.togni}@u-bourgogne.fr
More informationOn zero-sum partitions and anti-magic trees
Discrete Mathematics 09 (009) 010 014 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc On zero-sum partitions and anti-magic trees Gil Kaplan,
More informationLaplacian 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 information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationBichain graphs: geometric model and universal graphs
Bichain graphs: geometric model and universal graphs Robert Brignall a,1, Vadim V. Lozin b,, Juraj Stacho b, a Department of Mathematics and Statistics, The Open University, Milton Keynes MK7 6AA, United
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationPacking of Rigid Spanning Subgraphs and Spanning Trees
Packing of Rigid Spanning Subgraphs and Spanning Trees Joseph Cheriyan Olivier Durand de Gevigney Zoltán Szigeti December 14, 2011 Abstract We prove that every 6k + 2l, 2k-connected simple graph contains
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 informationPARTITIONS OF FINITE VECTOR SPACES INTO SUBSPACES
PARTITIONS OF FINITE VECTOR SPACES INTO SUBSPACES S.I. EL-ZANATI, G.F. SEELINGER, P.A. SISSOKHO, L.E. SPENCE, AND C. VANDEN EYNDEN Abstract. Let V n (q) denote a vector space of dimension n over the field
More informationAdvanced Combinatorial Optimization September 24, Lecture 5
18.438 Advanced Combinatorial Optimization September 24, 2009 Lecturer: Michel X. Goemans Lecture 5 Scribe: Yehua Wei In this lecture, we establish the connection between nowhere-zero (nwz) k-flow and
More informationMonochromatic tree covers and Ramsey numbers for set-coloured graphs
Monochromatic tree covers and Ramsey numbers for set-coloured graphs Sebastián Bustamante and Maya Stein Department of Mathematical Engineering University of Chile August 31, 2017 Abstract We consider
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh June 2009 1 Linear independence These problems both appeared in a course of Benny Sudakov at Princeton, but the links to Olympiad problems are due to Yufei
More informationExtremal H-colorings of graphs with fixed minimum degree
Extremal H-colorings of graphs with fixed minimum degree John Engbers July 18, 2014 Abstract For graphs G and H, a homomorphism from G to H, or H-coloring of G, is a map from the vertices of G to the vertices
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 informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh 27 June 2008 1 Warm-up 1. (A result of Bourbaki on finite geometries, from Răzvan) Let X be a finite set, and let F be a family of distinct proper subsets
More informationAutomorphism groups of wreath product digraphs
Automorphism groups of wreath product digraphs Edward Dobson Department of Mathematics and Statistics Mississippi State University PO Drawer MA Mississippi State, MS 39762 USA dobson@math.msstate.edu Joy
More informationDefinitions. 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 informationPartial 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 informationMinimal Paths and Cycles in Set Systems
Minimal Paths and Cycles in Set Systems Dhruv Mubayi Jacques Verstraëte July 9, 006 Abstract A minimal k-cycle is a family of sets A 0,..., A k 1 for which A i A j if and only if i = j or i and j are consecutive
More informationAdvanced Combinatorial Optimization Updated February 18, Lecture 5. Lecturer: Michel X. Goemans Scribe: Yehua Wei (2009)
18.438 Advanced Combinatorial Optimization Updated February 18, 2012. Lecture 5 Lecturer: Michel X. Goemans Scribe: Yehua Wei (2009) In this lecture, we establish the connection between nowhere-zero k-flows
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
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 informationDISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS
DISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER In memory of Mike Albertson. Abstract. A distinguishing partition for an action of a group Γ on a set
More informationCMPSCI 250: Introduction to Computation. Lecture #11: Equivalence Relations David Mix Barrington 27 September 2013
CMPSCI 250: Introduction to Computation Lecture #11: Equivalence Relations David Mix Barrington 27 September 2013 Equivalence Relations Definition of Equivalence Relations Two More Examples: Universal
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric
More informationArbitrary decompositions into open and closed trails
MATEMATYKA DYSKRETNA www.ii.uj.edu.pl/premd/ Sylwia CICHACZ, Yoshimi EGAWA and Mariusz WOŹNIAK Arbitrary decompositions into open and closed trails Preprint Nr MD 030 (otrzymany dnia 30 maja 2007) Kraków
More informationEven 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 informationThe structure of bull-free graphs II elementary trigraphs
The structure of bull-free graphs II elementary trigraphs Maria Chudnovsky Columbia University, New York, NY 10027 USA May 6, 2006; revised April 25, 2011 Abstract The bull is a graph consisting of a triangle
More informationRamsey Theory. May 24, 2015
Ramsey Theory May 24, 2015 1 König s Lemma König s Lemma is a basic tool to move between finite and infinite combinatorics. To be concise, we use the notation [k] = {1, 2,..., k}, and [X] r will denote
More informationNotes on Freiman s Theorem
Notes on Freiman s Theorem Jacques Verstraëte Department of Mathematics University of California, San Diego La Jolla, CA, 92093. E-mail: jacques@ucsd.edu. 1 Introduction Freiman s Theorem describes the
More informationStrongly Regular Decompositions of the Complete Graph
Journal of Algebraic Combinatorics, 17, 181 201, 2003 c 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. Strongly Regular Decompositions of the Complete Graph EDWIN R. VAN DAM Edwin.vanDam@uvt.nl
More informationRECOVERING NORMAL NETWORKS FROM SHORTEST INTER-TAXA DISTANCE INFORMATION
RECOVERING NORMAL NETWORKS FROM SHORTEST INTER-TAXA DISTANCE INFORMATION MAGNUS BORDEWICH, KATHARINA T. HUBER, VINCENT MOULTON, AND CHARLES SEMPLE Abstract. Phylogenetic networks are a type of leaf-labelled,
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 informationRing Sums, Bridges and Fundamental Sets
1 Ring Sums Definition 1 Given two graphs G 1 = (V 1, E 1 ) and G 2 = (V 2, E 2 ) we define the ring sum G 1 G 2 = (V 1 V 2, (E 1 E 2 ) (E 1 E 2 )) with isolated points dropped. So an edge is in G 1 G
More informationCLIQUES IN THE UNION OF GRAPHS
CLIQUES IN THE UNION OF GRAPHS RON AHARONI, ELI BERGER, MARIA CHUDNOVSKY, AND JUBA ZIANI Abstract. Let B and R be two simple graphs with vertex set V, and let G(B, R) be the simple graph with vertex set
More informationInduced Saturation Number
Graduate Theses and Dissertations Iowa State University Capstones, Theses and Dissertations 2012 Induced Saturation Number Jason James Smith Iowa State University Follow this and additional works at: https://lib.dr.iastate.edu/etd
More informationChapter 7 Matchings and r-factors
Chapter 7 Matchings and r-factors Section 7.0 Introduction Suppose you have your own company and you have several job openings to fill. Further, suppose you have several candidates to fill these jobs and
More informationChapter 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 informationarxiv: v1 [math.co] 1 Oct 2013
Tiling in bipartite graphs with asymmetric minimum degrees Andrzej Czygrinow and Louis DeBiasio November 9, 018 arxiv:1310.0481v1 [math.co] 1 Oct 013 Abstract The problem of determining the optimal minimum
More informationColoring square-free Berge graphs
Coloring square-free Berge graphs Maria Chudnovsky Irene Lo Frédéric Maffray Nicolas Trotignon Kristina Vušković September 30, 2015 Abstract We consider the class of Berge graphs that do not contain a
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric
More informationINFINITE RINGS WITH PLANAR ZERO-DIVISOR GRAPHS
INFINITE RINGS WITH PLANAR ZERO-DIVISOR GRAPHS YONGWEI YAO Abstract. For any commutative ring R that is not a domain, there is a zerodivisor graph, denoted Γ(R), in which the vertices are the nonzero zero-divisors
More informationThree-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 informationRoot systems and optimal block designs
Root systems and optimal block designs Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, UK p.j.cameron@qmul.ac.uk Abstract Motivated by a question
More informationFoundations of Mathematics
Foundations of Mathematics L. Pedro Poitevin 1. Preliminaries 1.1. Sets We will naively think of a set as a collection of mathematical objects, called its elements or members. To indicate that an object
More informationThe Interlace Polynomial of Graphs at 1
The Interlace Polynomial of Graphs at 1 PN Balister B Bollobás J Cutler L Pebody July 3, 2002 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152 USA Abstract In this paper we
More informationOn the number of edge-disjoint triangles in K 4 -free graphs
On the number of edge-disjoint triangles in K 4 -free graphs arxiv:1506.03306v1 [math.co] 10 Jun 2015 Ervin Győri Rényi Institute Hungarian Academy of Sciences Budapest, Hungary gyori.ervin@renyi.mta.hu
More informationOn Hadamard Diagonalizable Graphs
On Hadamard Diagonalizable Graphs S. Barik, S. Fallat and S. Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A2 Abstract Of interest here is a characterization
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 informationLecture 8: Equivalence Relations
Lecture 8: Equivalence Relations 1 Equivalence Relations Next interesting relation we will study is equivalence relation. Definition 1.1 (Equivalence Relation). Let A be a set and let be a relation on
More informationREVIEW QUESTIONS. Chapter 1: Foundations: Sets, Logic, and Algorithms
REVIEW QUESTIONS Chapter 1: Foundations: Sets, Logic, and Algorithms 1. Why can t a Venn diagram be used to prove a statement about sets? 2. Suppose S is a set with n elements. Explain why the power set
More informationAbstract. We show that a proper coloring of the diagram of an interval order I may require 1 +
Colorings of Diagrams of Interval Orders and -Sequences of Sets STEFAN FELSNER 1 and WILLIAM T. TROTTER 1 Fachbereich Mathemati, TU-Berlin, Strae des 17. Juni 135, 1000 Berlin 1, Germany, partially supported
More informationEconomics 204 Fall 2011 Problem Set 1 Suggested Solutions
Economics 204 Fall 2011 Problem Set 1 Suggested Solutions 1. Suppose k is a positive integer. Use induction to prove the following two statements. (a) For all n N 0, the inequality (k 2 + n)! k 2n holds.
More informationColourings of cubic graphs inducing isomorphic monochromatic subgraphs
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs arxiv:1705.06928v1 [math.co] 19 May 2017 Marién Abreu 1, Jan Goedgebeur 2, Domenico Labbate 1, Giuseppe Mazzuoccolo 3 1 Dipartimento
More informationQuadratic reciprocity and the Jacobi symbol Stephen McAdam Department of Mathematics University of Texas at Austin
Quadratic reciprocity and the Jacobi symbol Stephen McAdam Department of Mathematics University of Texas at Austin mcadam@math.utexas.edu Abstract: We offer a proof of quadratic reciprocity that arises
More informationThe structure of bull-free graphs I three-edge-paths with centers and anticenters
The structure of bull-free graphs I three-edge-paths with centers and anticenters Maria Chudnovsky Columbia University, New York, NY 10027 USA May 6, 2006; revised March 29, 2011 Abstract The bull is the
More informationOdd independent transversals are odd
Odd independent transversals are odd Penny Haxell Tibor Szabó Dedicated to Béla Bollobás on the occasion of his 60th birthday Abstract We put the final piece into a puzzle first introduced by Bollobás,
More informationarxiv: v1 [math.co] 23 Nov 2015
arxiv:1511.07306v1 [math.co] 23 Nov 2015 RAMSEY NUMBERS OF TREES AND UNICYCLIC GRAPHS VERSUS FANS MATTHEW BRENNAN Abstract. The generalized Ramsey number R(H, K) is the smallest positive integer n such
More informationTree-width and planar minors
Tree-width and planar minors Alexander Leaf and Paul Seymour 1 Princeton University, Princeton, NJ 08544 May 22, 2012; revised March 18, 2014 1 Supported by ONR grant N00014-10-1-0680 and NSF grant DMS-0901075.
More informationBranchwidth of graphic matroids.
Branchwidth of graphic matroids. Frédéric Mazoit and Stéphan Thomassé Abstract Answering a question of Geelen, Gerards, Robertson and Whittle [2], we prove that the branchwidth of a bridgeless graph is
More informationChapter 0. Introduction: Prerequisites and Preliminaries
Chapter 0. Sections 0.1 to 0.5 1 Chapter 0. Introduction: Prerequisites and Preliminaries Note. The content of Sections 0.1 through 0.6 should be very familiar to you. However, in order to keep these notes
More informationTree sets. Reinhard Diestel
1 Tree sets Reinhard Diestel Abstract We study an abstract notion of tree structure which generalizes treedecompositions of graphs and matroids. Unlike tree-decompositions, which are too closely linked
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 informationARTICLE IN PRESS Theoretical Computer Science ( )
Theoretical Computer Science ( ) Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Conditional matching preclusion for hypercube-like
More informationSet-orderedness as a generalization of k-orderedness and cyclability
Set-orderedness as a generalization of k-orderedness and cyclability Keishi Ishii Kenta Ozeki National Institute of Informatics, Tokyo 101-8430, Japan e-mail: ozeki@nii.ac.jp Kiyoshi Yoshimoto Department
More informationDecomposing planar cubic graphs
Decomposing planar cubic graphs Arthur Hoffmann-Ostenhof Tomáš Kaiser Kenta Ozeki Abstract The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree,
More information4 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 informationMathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations
Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...
More informationConstructing Critical Indecomposable Codes
Constructing Critical Indecomposable Codes Judy L. Walker 1 Abstract Critical indecomposable codes were introduced by Assmus [1], who also gave a recursive construction for these objects. One of the key
More informationBerge Trigraphs. Maria Chudnovsky 1 Princeton University, Princeton NJ March 15, 2004; revised December 2, Research Fellow.
Berge Trigraphs Maria Chudnovsky 1 Princeton University, Princeton NJ 08544 March 15, 2004; revised December 2, 2005 1 This research was partially conducted during the period the author served as a Clay
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 informationA lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo
A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 2008-02-28 Abstract We show that if µ j is the j-th largest Laplacian eigenvalue, and d
More informationDISCRETIZED CONFIGURATIONS AND PARTIAL PARTITIONS
DISCRETIZED CONFIGURATIONS AND PARTIAL PARTITIONS AARON ABRAMS, DAVID GAY, AND VALERIE HOWER Abstract. We show that the discretized configuration space of k points in the n-simplex is homotopy equivalent
More informationPartial 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 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 informationHAMBURGER BEITRÄGE ZUR MATHEMATIK
HAMBURGER BEITRÄGE ZUR MATHEMATIK Heft 8 Degree Sequences and Edge Connectivity Matthias Kriesell November 007 Degree sequences and edge connectivity Matthias Kriesell November 9, 007 Abstract For each
More informationIndependence in Function Graphs
Independence in Function Graphs Ralucca Gera 1, Craig E. Larson 2, Ryan Pepper 3, and Craig Rasmussen 1 1 Naval Postgraduate School, Department of Applied Mathematics, Monterey, CA 93943; rgera@nps.edu,
More informationClaw-free Graphs. III. Sparse decomposition
Claw-free Graphs. III. Sparse decomposition Maria Chudnovsky 1 and Paul Seymour Princeton University, Princeton NJ 08544 October 14, 003; revised May 8, 004 1 This research was conducted while the author
More informationList of Theorems. Mat 416, Introduction to Graph Theory. Theorem 1 The numbers R(p, q) exist and for p, q 2,
List of Theorems Mat 416, Introduction to Graph Theory 1. Ramsey s Theorem for graphs 8.3.11. Theorem 1 The numbers R(p, q) exist and for p, q 2, R(p, q) R(p 1, q) + R(p, q 1). If both summands on the
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 informationMaximal and Maximum Independent Sets In Graphs With At Most r Cycles
Maximal and Maximum Independent Sets In Graphs With At Most r Cycles Bruce E. Sagan Department of Mathematics Michigan State University East Lansing, MI sagan@math.msu.edu Vincent R. Vatter Department
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 informationGiven any simple graph G = (V, E), not necessarily finite, and a ground set X, a set-indexer
Chapter 2 Topogenic Graphs Given any simple graph G = (V, E), not necessarily finite, and a ground set X, a set-indexer of G is an injective set-valued function f : V (G) 2 X such that the induced edge
More informationDECOMPOSITIONS 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 information5. 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 information1.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 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 informationDefinition: Let S and T be sets. A binary relation on SxT is any subset of SxT. A binary relation on S is any subset of SxS.
4 Functions Before studying functions we will first quickly define a more general idea, namely the notion of a relation. A function turns out to be a special type of relation. Definition: Let S and T be
More informationGallai-Ramsey numbers for a class of graphs with five vertices arxiv: v1 [math.co] 15 Nov 2018
Gallai-Ramsey numbers for a class of graphs with five vertices arxiv:1811.06134v1 [math.co] 15 Nov 018 Xihe Li a,b and Ligong Wang a,b, a Department of Applied Mathematics, School of Science, Northwestern
More informationSets and Functions. (As we will see, in describing a set the order in which elements are listed is irrelevant).
Sets and Functions 1. The language of sets Informally, a set is any collection of objects. The objects may be mathematical objects such as numbers, functions and even sets, or letters or symbols of any
More informationOut-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 informationarxiv: v1 [math.co] 5 May 2016
Uniform hypergraphs and dominating sets of graphs arxiv:60.078v [math.co] May 06 Jaume Martí-Farré Mercè Mora José Luis Ruiz Departament de Matemàtiques Universitat Politècnica de Catalunya Spain {jaume.marti,merce.mora,jose.luis.ruiz}@upc.edu
More informationIntroduction to Real Analysis Alternative Chapter 1
Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces
More information