Strange Combinatorial Connections. Tom Trotter
|
|
- Marsha Arnold
- 6 years ago
- Views:
Transcription
1 Strange Combinatorial Connections Tom Trotter Georgia Institute of Technology February 13, 2003
2 Proper Graph Colorings Definition. A proper r- coloring of a graph G is a map φ from the vertex set of G to {1, 2,..., r} so that φ(x) φ(y) whenever x and y are adjacent vertices in G
3 Chromatic Number Definition. The chromatic number χ(g) is the fewest number of colors required for a proper coloring of G
4 Partially Ordered Sets (Posets) Definition. A partially ordered set P is a pair (X, P ) where X is a set and P is a reflexive, antisymmetric and transitive binary relation on X.
5 Interval Orders Definition. A poset P = (X, P ) is an interval order if for every x X, there is a closed interval [a x, b x ] of the real line R so that x < y in P if and only if b x < a y in R. d c b y b a x y c d x a
6 Sets and Inclusion abdefh fg abcdf abeh f abde abcd ac abe bd a b
7 Subset Lattices - Cubes abcd abc abd acd bcd ab ac bc ad bd cd a b c d
8 Chromatic Number of Poset Diagrams Proposition. If P is a poset of height h, then the chromatic number of the diagram of P is at most h.
9 A Ramsey Theoretic Construction Theorem. [Nešetrǐl and Rődl] For every h 1, there exists a poset P of height h so that the chromatic number of the diagram of P is h.
10 A Ramsey Theoretic Construction Theorem. [Nešetrǐl and Rődl] For every h 1, there exists a poset P of height h so that the chromatic number of the diagram of P is h. The preceding theorem is an immediate consequence of a more general result which provides an explicit construction of simple hypergraphs with large girth and large chromatic number.
11 Strange Problem Number 1 Problem. For each t 1, find the largest integer h = C(t) so that whenever P is an interval order of height h, the chromatic number of the diagram of P is at most t.
12 Strange Problem Number 1 Problem. For each t 1, find the largest integer h = C(t) so that whenever P is an interval order of height h, the chromatic number of the diagram of P is at most t. Remark. C(t) > c t. It is not too difficult to show that there exists a constant c > 1 so that
13 Strange Problem Number 2 Definition. A sequence (S 0, S 1,..., S h ) of sets is called an F -sequence if 1. S 0 S 1, and 2. S j S i S i+1 when j > i + 1.
14 Strange Problem Number 2 Definition. A sequence (S 0, S 1,..., S h ) of sets is called an F -sequence if 1. S 0 S 1, and 2. S j S i S i+1 when j > i + 1. Problem. For each positive integer t, find the largest positive integer h = F (t) for which there exists an F -sequence (S 0, S 1,..., S h ) of subsets of {1, 2,..., t}.
15 Examples Example. (, {1}, {2}, {3}, {1, 3}, {1, 2, 3}) is an F sequence of subsets of {1, 2, 3}.
16 Examples Example. (, {1}, {2}, {3}, {1, 3}, {1, 2, 3}) is an F sequence of subsets of {1, 2, 3}. So F (3) 5.
17 Examples Example. (, {1}, {2}, {3}, {1, 3}, {1, 2, 3}) is an F sequence of subsets of {1, 2, 3}. So F (3) 5. In fact, F (3) = 5.
18 Examples Example. (, {1}, {2}, {3}, {1, 3}, {1, 2, 3}) is an F sequence of subsets of {1, 2, 3}. So F (3) 5. In fact, F (3) = 5. Example. (, {1}, {2}, {3}, {4}, {2, 4}, {1, 4}, {1, 3}, {1, 2, 3}, {2, 3, 4}) is an F sequence of subsets of {1, 2, 3, 4}.
19 Examples Example. (, {1}, {2}, {3}, {1, 3}, {1, 2, 3}) is an F sequence of subsets of {1, 2, 3}. So F (3) 5. In fact, F (3) = 5. Example. (, {1}, {2}, {3}, {4}, {2, 4}, {1, 4}, {1, 3}, {1, 2, 3}, {2, 3, 4}) is an F sequence of subsets of {1, 2, 3, 4}. So F (4) 9.
20 Examples Example. (, {1}, {2}, {3}, {1, 3}, {1, 2, 3}) is an F sequence of subsets of {1, 2, 3}. So F (3) 5. In fact, F (3) = 5. Example. (, {1}, {2}, {3}, {4}, {2, 4}, {1, 4}, {1, 3}, {1, 2, 3}, {2, 3, 4}) is an F sequence of subsets of {1, 2, 3, 4}. So F (4) 9. In fact, F (4) = 9.
21 Long F -Sequences Lemma. [Felsner and Trotter] If k and t are positive integers with k < t and h = 1 + ( ) t 1 k, then there exists an F -sequence (S0, S 1,..., S h ) of k-element subsets of {1, 2,..., t} so that S i S i+1 = 2 for all i = 1, 2,..., h 1
22 Long F -Sequences Lemma. [Felsner and Trotter] If k and t are positive integers with k < t and h = 1 + ( ) t 1 k, then there exists an F -sequence (S0, S 1,..., S h ) of k-element subsets of {1, 2,..., t} so that S i S i+1 = 2 for all i = 1, 2,..., h 1 Corollary. [Felsner and Trotter] For all t 1, F (t) > 2 t 2.
23 Hamiltonian Cycles in Cubes Proposition. For t 2, the t-cube has a hamiltonian cycle.
24 Hamiltonian Cycles in Cubes Proposition. For t 2, the t-cube has a hamiltonian cycle. abcd abc abd acd bcd ab ac bc ad bd cd a b c d
25 Corresponding Edges Then select any pair of corresponding edges: abcd abc abd acd bcd ab ac bc ad bd cd a b c d
26 Exchange edges as shown: A hamiltonian cycle in the t + 1-cube abcd abc abd acd bcd ab ac bc ad bd cd a b c d
27 Monotone Hamiltonian Paths Definition. Let t be a positive integer and let n = 2 t. A listing (A 1, A 2,..., A t ) of the subsets of {1, 2,..., t} is called a monotone hamiltonian path in the t-cube if 1. A 1 =, and 2. If 1 < i < t and S A i, then S = A j for some j {1, 2,..., i + 1}.
28 The 2-Cube - Getting Started ab a b
29 The 2-Cube - Must Go Up ab a b
30 The 2-Cube - Last Move is Forced ab a b
31 The 3-Cube - Getting Started abc ab ac bc a b c
32 The 3-Cube - Must Go Up abc ab ac bc a b c
33 The 3-Cube - Must Go Back Down abc ab ac bc a b c
34 The 3-Cube - Forced Move abc ab ac bc a b c
35 The 3-Cube - SUCCESS!! abc ab ac bc a b c
36 The 4-Cube - Getting Started abcd abc abd acd bcd ab ac bc ad bd cd a b c d
37 The 4-Cube - Try Left abcd abc abd acd bcd ab ac bc ad bd cd a b c d
38 The 4-Cube - Right is Illegal!! abcd abc abd acd bcd ab ac bc ad bd cd a b c d
39 The 4-Cube - Must go Up abcd abc abd acd bcd ab ac bc ad bd cd a b c d
40 The 4-Cube - Only Move is Illegal!! abcd abc abd acd bcd ab ac bc ad bd cd a b c d
41 The 4-Cube - Backtrack to Here abcd abc abd acd bcd ab ac bc ad bd cd a b c d
42 The 4-Cube - Try Right abcd abc abd acd bcd ab ac bc ad bd cd a b c d
43 The 4-Cube - Try Left abcd abc abd acd bcd ab ac bc ad bd cd a b c d
44 The 4-Cube - Straight Up Illegal!! abcd abc abd acd bcd ab ac bc ad bd cd a b c d
45 The 4-Cube - Right is Illegal Too! abcd abc abd acd bcd ab ac bc ad bd cd a b c d
46 The 4-Cube - Backtrack to Here abcd abc abd acd bcd ab ac bc ad bd cd a b c d
47 The 4-Cube - Must go Straight Up abcd abc abd acd bcd ab ac bc ad bd cd a b c d
48 The 4-Cube - Right Doesn t Work abcd abc abd acd bcd ab ac bc ad bd cd a b c d
49 The 4-Cube - Backtrack to Here abcd abc abd acd bcd ab ac bc ad bd cd a b c d
50 The 4-Cube - Try Left abcd abc abd acd bcd ab ac bc ad bd cd a b c d
51 The 4-Cube - Must go Right abcd abc abd acd bcd ab ac bc ad bd cd a b c d
52 The 4-Cube - SUCCESS!! abcd abc abd acd bcd ab ac bc ad bd cd a b c d
53 A Monotone Hamiltonian Path in the 5-Cube
54 Strange Problem Number 3 Conjecture. t-cube. For every t 1, there exists a monotone hamiltonian path in the
55 Computational Results The following table shows the number H(t) of monotone hamiltonian paths in the t-cube: H(1) = 1 H(2) = 1 H(3) = 1 H(4) = 1 H(5) = 10 H(6) = 123 H(7) =
56 More Computational Results Also, H(8) > 10 14
57 More Computational Results Also, H(8) > H(9) > 0
58 More Computational Results Also, H(8) > H(9) > 0 H(10) > 0
59 Combinatorial Connections Recall that 1. C(t) is the largest integer h so that whenever P is an interval order of height h, the chromatic number of the diagram of P is at most t.
60 Combinatorial Connections Recall that 1. C(t) is the largest integer h so that whenever P is an interval order of height h, the chromatic number of the diagram of P is at most t. 2. F (t) is the largest h for which there exists an F -sequence (S 0, S 1,..., S h ) of subsets of {1, 2,..., t}.
61 Combinatorial Connections Recall that 1. C(t) is the largest integer h so that whenever P is an interval order of height h, the chromatic number of the diagram of P is at most t. 2. F (t) is the largest h for which there exists an F -sequence (S 0, S 1,..., S h ) of subsets of {1, 2,..., t}. Theorem. [Felsner and Trotter] For every t 1, C(t) = F (t).
62 A Natural Partition into Antichains Let P = (X, P ) be a poset of height h. Then for each x X, let d(x) denote the largest positive integer i for which there exists a chain x = x 1 < x 2 < < x i in P.
63 A Natural Partition into Antichains Let P = (X, P ) be a poset of height h. Then for each x X, let d(x) denote the largest positive integer i for which there exists a chain x = x 1 < x 2 < < x i in P. Remark. For each i = 1, 2,..., h, the set X i = {x X : d(x) = h + 1 i} is an antichain in P and is a partition into antichains. X = X 1 X 2 X h
64 Special Property of Interval Orders Remark. Let x be a point in an interval order P. Then any two points covered by x differ in depth by at most 1. x
65 Using F -sequences to Color Diagrams Here s the proof that C(t) F (t) for all t 1.
66 Using F -sequences to Color Diagrams Here s the proof that C(t) F (t) for all t Vertices from X j will get colors from S j.
67 Using F -sequences to Color Diagrams Here s the proof that C(t) F (t) for all t Vertices from X j will get colors from S j. 2. For each x X j, choose a color from S j which does not belong to S i S i+1 where all points covered by x come from X i X i+1.
68 Using F -sequences to Color Diagrams Here s the proof that C(t) F (t) for all t Vertices from X j will get colors from S j. 2. For each x X j, choose a color from S j which does not belong to S i S i+1 where all points covered by x come from X i X i+1. Showing that F (t) C(t) for all t 1 is somewhat more complicated and requires a Ramsey theoretic argument.
69 F -Sequences and Monotone Hamiltonian Paths Lemma. [Felsner and Trotter] If there is a monotone hamiltonian path in a t-cube, then there is an F -sequence (S 0, S 1,..., S h ) of subsets of {1, 2,..., t} with h = 2 t 1 + t 1 2.
70 Example abcd abc abd acd bcd ab ac bc ad bd cd a b c d
71 Example abcd abc abd acd bcd ab ac bc ad bd cd a b c d Example. (, {a}, {b}, {c}, {d}, {b, d}, {a, d}, {a, c}, {a, b, c}, {b, c, d}) is an F sequence of subsets of {a, b, c, d}.
72 F -Sequences and Monotone Hamiltonian Paths Theorem. [Felsner and Trotter] For each t 1, F (t) 2 t 1 + t 1 2 with equality holding if and only if there is a monotone hamiltonian path in the t-cube.
73 Partial Results Remark. If there is a monotone hamiltonian path in the t-cube, then for odd k, there must exist an F -sequence (S 0, S 1,..., S h ) of k-element subsets of {1, 2,..., t} so that t = 1 + ( ) t 1 k and Si S i+1 = 2 for all i = 1, 2,..., h 1
74 Partial Results Remark. If there is a monotone hamiltonian path in the t-cube, then for odd k, there must exist an F -sequence (S 0, S 1,..., S h ) of k-element subsets of {1, 2,..., t} so that t = 1 + ( ) t 1 k and Si S i+1 = 2 for all i = 1, 2,..., h 1 Remark. Such F -sequences exist for all t and all k, both even and odd.
75 1. Shift Graphs Other Combinatorial Connections
76 Other Combinatorial Connections 1. Shift Graphs 2. Dedekind s problem
77 Other Combinatorial Connections 1. Shift Graphs 2. Dedekind s problem 3. Dimension of graphs
78 Other Combinatorial Connections 1. Shift Graphs 2. Dedekind s problem 3. Dimension of graphs 4. Correlation Inequalities
79 The Evidence is Overwhelming Recall that: H(1) = 1 H(2) = 2 H(3) = 6 H(4) = 24 H(5) = 1440 H(6) = H(7) =
80 Nevertheless...
81 Nevertheless... Conjecture. [WTT s Wild One] If t is sufficiently large, H(t) = 0, there are no monotone hamiltonian paths in the t-cube.
NEW PERSPECTIVES ON INTERVAL ORDERS AND INTERVAL GRAPHS
NEW PERSPECTIVES ON INTERVAL ORDERS AND INTERVAL GRAPHS WILLIAM T. TROTTER Abstract. Interval orders and interval graphs are particularly natural examples of two widely studied classes of discrete structures:
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 informationPlanar Posets and Minimal Elements
SIAM Discrete Math - June 17, 2014 Planar Posets and Minimal Elements William T. Trotter trotter@math.gatech.edu Joint Research with Ruidong Wang Ph.D. Georgia Tech, 2015 (anticipated) Planar Posets Definition
More informationColoring. Basics. A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]).
Coloring Basics A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]). For an i S, the set f 1 (i) is called a color class. A k-coloring is called proper if adjacent
More informationMonotone Hamiltonian paths in the Boolean lattice of subsets
Monotone Hamiltonian paths in the Boolean lattice of subsets Csaba Biró and David Howard December 10, 2007 Abstract Consider the lattice whose elements are the subsets of the set of positive integers not
More informationLecture 12: Feb 16, 2017
CS 6170 Computational Topology: Topological Data Analysis Spring 2017 Lecture 12: Feb 16, 2017 Lecturer: Prof Bei Wang University of Utah School of Computing Scribe: Waiming Tai This
More informationAPPLICATIONS OF THE PROBABILISTIC METHOD TO PARTIALLY ORDERED SETS
APPLICATIONS OF THE PROBABILISTIC METHOD TO PARTIALLY ORDERED SETS WILLIAM T. TROTTER This paper is dedicated to Paul Erdős with appreciation for his impact on mathematics and the lives of mathematicians
More informationDuality in the Combinatorics of Posets
University of Minnesota, September 12, 2014 Duality in the Combinatorics of Posets William T. Trotter trotter@math.gatech.edu Diagram for a Poset on 26 points Terminology: b < i and s < y. j covers a.
More informationAdvanced Digital Design with the Verilog HDL, Second Edition Michael D. Ciletti Prentice Hall, Pearson Education, 2011
Problem 2-1 Recall that a minterm is a cube in which every variable appears. A Boolean expression in SOP form is canonical if every cube in the expression has a unique representation in which all of the
More informationCOMBINATORIAL PROBLEMS FOR GRAPHS AND PARTIALLY ORDERED SETS
COMBINATORIAL PROBLEMS FOR GRAPHS AND PARTIALLY ORDERED SETS A Thesis Presented to The Academic Faculty by Ruidong Wang In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in
More informationMassachusetts Institute of Technology 6.042J/18.062J, Fall 02: Mathematics for Computer Science Professor Albert Meyer and Dr.
Massachusetts Institute of Technology 6.042J/18.062J, Fall 02: Mathematics for Computer Science Professor Albert Meyer and Dr. Radhika Nagpal Quiz 1 Appendix Appendix Contents 1 Induction 2 2 Relations
More informationPROBLEMS AND RESULTS IN PARTIALLY ORDERED SETS, GRAPHS AND GEOMETRY
PROBLEMS AND RESULTS IN PARTIALLY ORDERED SETS, GRAPHS AND GEOMETRY A Thesis Presented to The Academic Faculty by Csaba Biró In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy
More informationHamiltonian Cycles and Symmetric Chains in Boolean Lattices
Graphs and Combinatorics (2014) 30:1565 1586 DOI 10.1007/s00373-013-1350-8 ORIGINAL PAPER Hamiltonian Cycles and Symmetric Chains in Boolean Lattices Noah Streib William T. Trotter Received: 30 April 2012
More informationProbabilistic Method. Benny Sudakov. Princeton University
Probabilistic Method Benny Sudakov Princeton University Rough outline The basic Probabilistic method can be described as follows: In order to prove the existence of a combinatorial structure with certain
More informationSection 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 informationRAMSEY THEORY FOR BINARY TREES AND THE SEPARATION OF TREE-CHROMATIC NUMBER FROM PATH-CHROMATIC NUMBER
RAMSEY THEORY FOR BINARY TREES AND THE SEPARATION OF TREE-CHROMATIC NUMBER FROM PATH-CHROMATIC NUMBER FIDEL BARRERA-CRUZ, STEFAN FELSNER, TAMÁS MÉSZÁROS, PIOTR MICEK, HEATHER SMITH, LIBBY TAYLOR, AND WILLIAM
More informationSUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS
SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS MARINA SEMENOVA AND FRIEDRICH WEHRUNG Abstract. For a partially ordered set P, let Co(P) denote the lattice of all order-convex
More informationARRANGEABILITY AND CLIQUE SUBDIVISIONS. Department of Mathematics and Computer Science Emory University Atlanta, GA and
ARRANGEABILITY AND CLIQUE SUBDIVISIONS Vojtěch Rödl* Department of Mathematics and Computer Science Emory University Atlanta, GA 30322 and Robin Thomas** School of Mathematics Georgia Institute of Technology
More informationMaximum union-free subfamilies
Maximum union-free subfamilies Jacob Fox Choongbum Lee Benny Sudakov Abstract An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called
More informationDefinition: 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 informationColorings of uniform hypergraphs with large girth
Colorings of uniform hypergraphs with large girth Andrey Kupavskii, Dmitry Shabanov Lomonosov Moscow State University, Moscow Institute of Physics and Technology, Yandex SIAM conference on Discrete Mathematics
More informationCircular Chromatic Numbers of Some Reduced Kneser Graphs
Circular Chromatic Numbers of Some Reduced Kneser Graphs Ko-Wei Lih Institute of Mathematics, Academia Sinica Nankang, Taipei 115, Taiwan E-mail: makwlih@sinica.edu.tw Daphne Der-Fen Liu Department of
More informationDIMENSION AND CUT VERTICES: AN APPLICATION OF RAMSEY THEORY
DIMENSION AND CUT VERTICES: AN APPLICATION OF RAMSEY THEORY WILLIAM T. TROTTER, BARTOSZ WALCZAK, AND RUIDONG WANG This paper is dedicated to Ronald L. Graham in celebration of his 80th birthday and in
More information3. R = = on Z. R, S, A, T.
6 Relations Let R be a relation on a set A, i.e., a subset of AxA. Notation: xry iff (x, y) R AxA. Recall: A relation need not be a function. Example: The relation R 1 = {(x, y) RxR x 2 + y 2 = 1} is not
More informationarxiv: v2 [math.co] 19 Jun 2018
arxiv:1705.06268v2 [math.co] 19 Jun 2018 On the Nonexistence of Some Generalized Folkman Numbers Xiaodong Xu Guangxi Academy of Sciences Nanning 530007, P.R. China xxdmaths@sina.com Meilian Liang School
More informationMultiple Choice Questions for Review
Equivalence and Order Multiple Choice Questions for Review In each case there is one correct answer (given at the end of the problem set). Try to work the problem first without looking at the answer. Understand
More informationOn the chromatic number and independence number of hypergraph products
On the chromatic number and independence number of hypergraph products Dhruv Mubayi Vojtĕch Rödl January 10, 2004 Abstract The hypergraph product G H has vertex set V (G) V (H), and edge set {e f : e E(G),
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 informationINDUCED CYCLES AND CHROMATIC NUMBER
INDUCED CYCLES AND CHROMATIC NUMBER A.D. SCOTT DEPARTMENT OF MATHEMATICS UNIVERSITY COLLEGE, GOWER STREET, LONDON WC1E 6BT Abstract. We prove that, for any pair of integers k, l 1, there exists an integer
More informationOn a correlation inequality of Farr
On a correlation inequality of Farr Colin McDiarmid, Department of Statistics Oxford University Abstract Suppose that each vertex of a graph independently chooses a colour uniformly from the set {1,...,
More informationMONOCHROMATIC FORESTS OF FINITE SUBSETS OF N
MONOCHROMATIC FORESTS OF FINITE SUBSETS OF N Tom C. Brown Department of Mathematics and Statistics, Simon Fraser University, Burnaby, BC Canada V5A 1S6 tbrown@sfu.ca Received: 2/3/00, Revised: 2/29/00,
More informationDesign theory for relational databases
Design theory for relational databases 1. Consider a relation with schema R(A,B,C,D) and FD s AB C, C D and D A. a. What are all the nontrivial FD s that follow from the given FD s? You should restrict
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 informationThe Saturation Number of Induced Subposets of the Boolean Lattice
The Saturation Number of Induced Subposets of the Boolean Lattice Michael Ferrara a, Bill Kay b, Lucas Kramer c,1, Ryan R. Martin d, Benjamin Reiniger e, Heather C. Smith f,, Eric Sullivan a a Department
More informationA note on general sliding window processes
A note on general sliding window processes Noga Alon Ohad N. Feldheim September 19, 214 Abstract Let f : R k [r] = {1, 2,..., r} be a measurable function, and let {U i } i N be a sequence of i.i.d. random
More informationarxiv: v1 [math.co] 2 Dec 2013
What is Ramsey-equivalent to a clique? Jacob Fox Andrey Grinshpun Anita Liebenau Yury Person Tibor Szabó arxiv:1312.0299v1 [math.co] 2 Dec 2013 November 4, 2018 Abstract A graph G is Ramsey for H if every
More informationAhlswede Khachatrian Theorems: Weighted, Infinite, and Hamming
Ahlswede Khachatrian Theorems: Weighted, Infinite, and Hamming Yuval Filmus April 4, 2017 Abstract The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of
More informationPlanar Ramsey Numbers for Small Graphs
Planar Ramsey Numbers for Small Graphs Andrzej Dudek Department of Mathematics and Computer Science Emory University Atlanta, GA 30322, USA Andrzej Ruciński Faculty of Mathematics and Computer Science
More informationarxiv: v3 [math.co] 25 Feb 2015
TREE-WIDTH AND DIMENSION GWENAËL JORET, PIOTR MICEK, KEVIN G. MILANS, WILLIAM T. TROTTER, BARTOSZ WALCZAK, AND RUIDONG WANG arxiv:1301.5271v3 [math.co] 25 Feb 2015 Abstract. Over the last 30 years, researchers
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
More informationOn subgraphs of large girth
1/34 On subgraphs of large girth In Honor of the 50th Birthday of Thomas Vojtěch Rödl rodl@mathcs.emory.edu joint work with Domingos Dellamonica May, 2012 2/34 3/34 4/34 5/34 6/34 7/34 ARRANGEABILITY AND
More informationGeometry Problem Solving Drill 08: Congruent Triangles
Geometry Problem Solving Drill 08: Congruent Triangles Question No. 1 of 10 Question 1. The following triangles are congruent. What is the value of x? Question #01 (A) 13.33 (B) 10 (C) 31 (D) 18 You set
More informationOn the oriented chromatic index of oriented graphs
On the oriented chromatic index of oriented graphs Pascal Ochem, Alexandre Pinlou, Éric Sopena LaBRI, Université Bordeaux 1, 351, cours de la Libération 33405 Talence Cedex, France February 19, 2006 Abstract
More informationIndependent 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 informationONLINE LINEAR DISCREPANCY OF PARTIALLY ORDERED SETS
ONLINE LINEAR DISCREPANCY OF PARTIALLY ORDERED SETS MITCHEL T. KELLER, NOAH STREIB, AND WILLIAM T. TROTTER This article is dedicated to Professor Endre Szemerédi on the occasion of his 70 th birthday.
More informationBounds on the generalised acyclic chromatic numbers of bounded degree graphs
Bounds on the generalised acyclic chromatic numbers of bounded degree graphs Catherine Greenhill 1, Oleg Pikhurko 2 1 School of Mathematics, The University of New South Wales, Sydney NSW Australia 2052,
More informationRandom Lifts of Graphs
27th Brazilian Math Colloquium, July 09 Plan of this talk A brief introduction to the probabilistic method. A quick review of expander graphs and their spectrum. Lifts, random lifts and their properties.
More informationResonance in orbits of plane partitions and increasing tableaux. Jessica Striker North Dakota State University
Resonance in orbits of plane partitions and increasing tableaux Jessica Striker North Dakota State University joint work with Kevin Dilks (NDSU) and Oliver Pechenik (UIUC) February 19, 2016 J. Striker
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 informationOnline Linear Discrepancy of Partially Ordered Sets
BOLYAI SOCIETY An Irregular Mind MATHEMATICAL STUDIES, 21 (Szemerédi is 70) pp. 1 15. Online Linear Discrepancy of Partially Ordered Sets MITCHEL T. KELLER, NOAH STREIB and WILLIAM T. TROTTER This article
More informationEquivalence relations
Equivalence relations R A A is an equivalence relation if R is 1. reflexive (a, a) R 2. symmetric, and (a, b) R (b, a) R 3. transitive. (a, b), (b, c) R (a, c) R Example: Let S be a relation on people
More informationChoice Numbers of Multi-Bridge Graphs
Computer Science Journal of Moldova, vol.25, no.3(75), 2017 Julian Allagan Benkam Bobga Abstract Suppose ch(g) and χ(g) denote, respectively, the choice number and the chromatic number of a graph G = (V,E).
More informationOn (δ, χ)-bounded families of graphs
On (δ, χ)-bounded families of graphs András Gyárfás Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, P.O. Box 63 Budapest, Hungary, H-1518 gyarfas@sztaki.hu Manouchehr
More informationOn the algorithmic aspects of Hedetniemi s conjecture
On the algorithmic aspects of Hedetniemi s conjecture Claude Tardif Royal Military College of Canada PO Box 17000 Stn Forces, Kingston, ON Canada, K7K 7B4 March 25, 2009 Keywords: Graph colourings, graph
More informationIndividual Round CHMMC November 20, 2016
Individual Round CHMMC 20 November 20, 20 Problem. We say that d k d k d d 0 represents the number n in base 2 if each d i is either 0 or, and n d k ( 2) k + d k ( 2) k + + d ( 2) + d 0. For example, 0
More informationResearch Statement. Shanise Walker
Research Statement Shanise Walker Extremal combinatorics is a field at the heart of mathematics. It studies how large or small certain parameters of discrete structures can be if other parameters are given.
More informationNP-problems continued
NP-problems continued Page 1 Since SAT and INDEPENDENT SET can be reduced to each other we might think that there would be some similarities between the two problems. In fact, there is one such similarity.
More informationPolynomial-time Reductions
Polynomial-time Reductions Disclaimer: Many denitions in these slides should be taken as the intuitive meaning, as the precise meaning of some of the terms are hard to pin down without introducing the
More informationMonotone Gray Codes and the Middle Levels Problem
Monotone Gray Codes and the Middle Levels Problem Carla D. Savage Department of Computer Science North Carolina State University Raleigh, North Carolina 27695-8206 cds@adm.csc.ncsu.edu Peter Winkler Bellcore
More informationA taste of perfect graphs
A taste of perfect graphs Remark Determining the chromatic number of a graph is a hard problem, in general, and it is even hard to get good lower bounds on χ(g). An obvious lower bound we have seen before
More informationBoolean Algebra. Sungho Kang. Yonsei University
Boolean Algebra Sungho Kang Yonsei University Outline Set, Relations, and Functions Partial Orders Boolean Functions Don t Care Conditions Incomplete Specifications 2 Set Notation $09,3/#0,9 438 v V Element
More informationWeek 4-5: Generating Permutations and Combinations
Week 4-5: Generating Permutations and Combinations February 27, 2017 1 Generating Permutations We have learned that there are n! permutations of {1, 2,...,n}. It is important in many instances to generate
More information< k 2n. 2 1 (n 2). + (1 p) s) N (n < 1
List of Problems jacques@ucsd.edu Those question with a star next to them are considered slightly more challenging. Problems 9, 11, and 19 from the book The probabilistic method, by Alon and Spencer. Question
More informationInduced subgraphs of graphs with large chromatic number. IX. Rainbow paths
Induced subgraphs of graphs with large chromatic number. IX. Rainbow paths Alex Scott Oxford University, Oxford, UK Paul Seymour 1 Princeton University, Princeton, NJ 08544, USA January 20, 2017; revised
More informationLower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs
Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 7, no. 6, pp. 67 688 (03 DOI: 0.755/jgaa.003 Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs
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 informationR(p, k) = the near regular complete k-partite graph of order p. Let p = sk+r, where s and r are positive integers such that 0 r < k.
MATH3301 EXTREMAL GRAPH THEORY Definition: A near regular complete multipartite graph is a complete multipartite graph with orders of its partite sets differing by at most 1. R(p, k) = the near regular
More informationGenerating Permutations and Combinations
Generating Permutations and Combinations March 0, 005 Generating Permutations We have learned that there are n! permutations of {,,, n} It is important in many instances to generate a list of such permutations
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 informationMonochromatic and Rainbow Colorings
Chapter 11 Monochromatic and Rainbow Colorings There are instances in which we will be interested in edge colorings of graphs that do not require adjacent edges to be assigned distinct colors Of course,
More informationHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
Opuscula Mathematica Vol. 6 No. 006 Hanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS Abstract. A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a
More informationHomogeneous Structures and Ramsey Classes
Homogeneous Structures and Ramsey Classes Julia Böttcher April 27, 2005 In this project report we discuss the relation between Ramsey classes and homogeneous structures and give various examples for both
More informationThe Chromatic Number of Ordered Graphs With Constrained Conflict Graphs
The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs Maria Axenovich and Jonathan Rollin and Torsten Ueckerdt September 3, 016 Abstract An ordered graph G is a graph whose vertex set
More informationMathematics 2260H Geometry I: Euclidean geometry Trent University, Winter 2012 Quiz Solutions
Mathematics 2260H Geometry I: Euclidean geometry Trent University, Winter 2012 Quiz Solutions Quiz #1. Tuesday, 17 January, 2012. [10 minutes] 1. Given a line segment AB, use (some of) Postulates I V,
More informationThe Turán number of sparse spanning graphs
The Turán number of sparse spanning graphs Noga Alon Raphael Yuster Abstract For a graph H, the extremal number ex(n, H) is the maximum number of edges in a graph of order n not containing a subgraph isomorphic
More informationarxiv: v1 [math.co] 13 Oct 2016
Homomorphism bounds and edge-colourings of K 4 -minor-free graphs Laurent Beaudou a, Florent Foucaud a, Reza Naserasr b a LIMOS - CNRS UMR 6158, Université Blaise Pascal, Clermont-Ferrand (France). E-mails:
More informationD-bounded Distance-Regular Graphs
D-bounded Distance-Regular Graphs CHIH-WEN WENG 53706 Abstract Let Γ = (X, R) denote a distance-regular graph with diameter D 3 and distance function δ. A (vertex) subgraph X is said to be weak-geodetically
More informationOn the stable set of associated prime ideals of monomial ideals and square-free monomial ideals
On the stable set of associated prime ideals of monomial ideals and square-free monomial ideals Kazem Khashyarmanesh and Mehrdad Nasernejad The 10th Seminar on Commutative Algebra and Related Topics, 18-19
More informationCOMP 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 informationRainbow Hamilton cycles in uniform hypergraphs
Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI andrzej.dude@wmich.edu Alan Frieze Department of Mathematical Sciences Carnegie
More informationDeterminants: Introduction and existence
Math 5327 Spring 2018 Determinants: Introduction and existence In this set of notes I try to give the general theory of determinants in a fairly abstract setting. I will start with the statement of the
More informationMinimal enumerations of subsets of a nite set and the middle level problem
Discrete Applied Mathematics 114 (2001) 109 114 Minimal enumerations of subsets of a nite set and the middle level problem A.A. Evdokimov, A.L. Perezhogin 1 Sobolev Institute of Mathematics, Novosibirsk
More informationThe chromatic number of ordered graphs with constrained conflict graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 69(1 (017, Pages 74 104 The chromatic number of ordered graphs with constrained conflict graphs Maria Axenovich Jonathan Rollin Torsten Ueckerdt Department
More informationMonochromatic Boxes in Colored Grids
Monochromatic Boxes in Colored Grids Joshua Cooper, Stephen Fenner, and Semmy Purewal October 16, 008 Abstract A d-dimensional grid is a set of the form R = [a 1] [a d ] A d- dimensional box is a set of
More informationSolutions to Quiz 1. Problem 1 (20 points). Suppose S(n) is a predicate on natural numbers, n, and suppose. k N S(k) S(k + 2). (1)
Massachusetts Institute of Technology 6.042J/18.062J, Fall 02: Mathematics for Computer Science Professor Albert Meyer and Dr. Radhika Nagpal Solutions to Quiz 1 Problem 1 (20 points). Suppose S(n) is
More information18.312: Algebraic Combinatorics Lionel Levine. Lecture 11
18.312: Algebraic Combinatorics Lionel Levine Lecture date: March 15, 2011 Lecture 11 Notes by: Ben Bond Today: Mobius Algebras, µ( n ). Test: The average was 17. If you got < 15, you have the option to
More informationProbabilistic Proofs of Existence of Rare Events. Noga Alon
Probabilistic Proofs of Existence of Rare Events Noga Alon Department of Mathematics Sackler Faculty of Exact Sciences Tel Aviv University Ramat-Aviv, Tel Aviv 69978 ISRAEL 1. The Local Lemma In a typical
More informationVertex colorings of graphs without short odd cycles
Vertex colorings of graphs without short odd cycles Andrzej Dudek and Reshma Ramadurai Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 1513, USA {adudek,rramadur}@andrew.cmu.edu
More informationA quasisymmetric function generalization of the chromatic symmetric function
A quasisymmetric function generalization of the chromatic symmetric function Brandon Humpert University of Kansas Lawrence, KS bhumpert@math.ku.edu Submitted: May 5, 2010; Accepted: Feb 3, 2011; Published:
More informationZFC INDEPENDENCE AND SUBSET SUM
ZFC INDEPENDENCE AND SUBSET SUM S. GILL WILLIAMSON Abstract. Let Z be the integers and N the nonnegative integers. and let G = (N k, Θ) be a max-downward digraph. We study sets of functions H = {h ρ D
More informationOn the Approximability of Single-Machine Scheduling with Precedence Constraints
MATHEMATICS OF OPERATIONS RESEARCH Vol. 36, No. 4, November 2011, pp. 653 669 issn 0364-765X eissn 1526-5471 11 3604 0653 http://dx.doi.org/10.1287/moor.1110.0512 2011 INFORMS On the Approximability of
More informationINTERVAL PARTITIONS AND STANLEY DEPTH
INTERVAL PARTITIONS AND STANLEY DEPTH CSABA BIRÓ, DAVID M. HOWARD, MITCHEL T. KELLER, WILLIAM. T. TROTTER, AND STEPHEN J. YOUNG Abstract. In this paper, we answer a question posed by Herzog, Vladoiu, and
More informationFACTOR GRAPH OF NON-COMMUTATIVE RING
International Journal of Advanced Research in Engineering and Technology (IJARET) Volume 9, Issue 6, November - December 2018, pp. 178 183, Article ID: IJARET_09_06_019 Available online at http://www.iaeme.com/ijaret/issues.asp?jtype=ijaret&vtype=9&itype=6
More informationPaul Erdős and Graph Ramsey Theory
Paul Erdős and Graph Ramsey Theory Benny Sudakov ETH and UCLA Ramsey theorem Ramsey theorem Definition: The Ramsey number r(s, n) is the minimum N such that every red-blue coloring of the edges of a complete
More informationThe 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 informationFractional Factorial Designs
Fractional Factorial Designs ST 516 Each replicate of a 2 k design requires 2 k runs. E.g. 64 runs for k = 6, or 1024 runs for k = 10. When this is infeasible, we use a fraction of the runs. As a result,
More informationLecture 7: Karnaugh Map, Don t Cares
EE210: Switching Systems Lecture 7: Karnaugh Map, Don t Cares Prof. YingLi Tian Feb. 28, 2019 Department of Electrical Engineering The City College of New York The City University of New York (CUNY) 1
More information(a) How many pairs (A, B) are there with A, B [n] and A B? (The inclusion is required to be strict.)
1 Enumeration 11 Basic counting principles 1 June 2008, Question 1: (a) How many pairs (A, B) are there with A, B [n] and A B? (The inclusion is required to be strict) n/2 ( ) n (b) Find a closed form
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 informationMaximal Antichain Lattice Algorithms for Distributed Computatio
Maximal Antichain Lattice Algorithms for Distributed Computations Vijay K. Garg Parallel and Distributed Systems Lab, Department of Electrical and Computer Engineering, The University of Texas at Austin,
More information