Math 221 Final Exam Review
|
|
- Penelope Catherine Dorsey
- 5 years ago
- Views:
Transcription
1 Math 221 Final Exam Review Preliminary comment: Some of these problems a formulated using language and structures from graph theory. However they are generally self contained; no theorems from graph theory are needed. They are essentially applications of the counting methods that we have discussed all quarter. The necessary graph theoretic definitions are provided here. 1. Define a simple labelled graph on V to be a pair (V, E where V is a non-empty set, and E is a (possibly empty set of 2-element subsets of [V ]. The elements of E are called edges, and the elements of V are called vertices (singular vertex Thus E {S P owerset([n] : S = 2}. (When we did this problem in class, I drew pictures for small values of n. For most people it helps to visualize the construction of the graphs in stages. (a What is the maximum number of edges that a simple labelled graph on [n] can contain? 2 (b How many simple labelled graph on [n] contain exactly edges? ( ( n 2 (c How many simple labelled graphs on [n] are there? 2 (n 2 (d How many simple labelled graph on [n] have an even number of edges? (n. (Either by a bijection or by the binomial theorem. (e How many simple labelled graph on [n] have the property that {1, 2} is an edge, but {1, 3} is not? 2 (n 2 2 = 1 4 2(n 2. (There are only 2 2 decisions to mae, instead of If v is a vertex in simple labelled graph, define degree(v to be the number of edges that contain v. Let n 2017.
2 (a How simple labelled graphs on [n] have the property that vertex 221 has degree? (When we did this problem in class, I drew pictures showing how the graph is built up by first choosing the neighbors of vertex 221, then noting that the rest of the graph is just a simple labelled graph on n 1 vertices. (b How many simple labelled graphs have the property that no edge has both of its vertices odd? In other words, v, w E v w 0 mod 2. (You many assume that n is even. (This problem was done in class Let n = 2m; there are m vertices with even labels, and m vertices with odd labels. Then there are m 2 possible edges with one even vertex and one one odd vertex. There are also ( m 2 possible edges with both vertices odd. When forming a graph, for each of the m 2 + ( m 2 possible edges, we have two choices: include the edge or not. Hence the answer is 2 m2 +( m 2. (c How many simple labelled graphs on [n] have the property that no vertex has degree 0? We did this tough PIE problem in class. Let Ω be the set of all simple labelled graphs on [n]. Let A i = {G : vertex i is isolated}. n The problem is to determine the cardinality of A i. If S is any set of vertices, then the number of graphs in which all the vertices in S have degree 0 is 2 (n 2. Hence, by inclusion exclusion, n A i = Ω A i A i A j +... i=1 i=1 i<j ( ( = 2 (n 2 n 2 (n 1 2 n + 2 (n ( n = 2 (n j 2. j j=0 i=1 2
3 I don t now a way to simplify this expression. However you might be interested to now that, if n is large, the first term in the sum is much larger than all the rest combined. Most graphs don t have any vertices of degree Multigraphs are a generalization of graphs in which more than one edge is permitted between two vertices. More formally, a simple labelled multigraph on V is a pair (V, E where V is a non-empty set, and E is a multiset of 2-elements subsets of V. (a How many multigraphs on [n] have exactly edges? For each edge {u, v}, let X {u,v} be the number of edges between u and v. Then the problem is to determine the number of solutions to the equation X {u,v} = {u,v} The number of terms in the sum is 2. So we can apply the counting table directly to get the answer: ( (b How many multigraphs on [n] have edges with vertex 1 having degree d? Mae sure you understand problem 2a before doing this one. This one is more complicated because repeated edges are permitted. First lets count the number of ways to choose that edges that contain vertex 1. For each v > 1, let Y v be the number of copies of the edge {1, v}. Then each Y v is non-negative and n v=2 Y v = d From the counting table, the number of ways to choose the d neighbors of vertex 1 is ( d+(n 1 1 n 2. The rest of the graph (the d edges that do not contain vertex 1 form a simple labelled multigraph on [n 1] with d edges. By the same argument as in part (a, the number of ways to choose this part of the graph is ( ( d Putting the pieces
4 together, we get the final answer: Whew! ( d + (n 1 1 n 2 ( ( d A directed graph on V is pair (V, E where V is a non-empty set and E V V. These differ in two ways from simple labelled graphs. First the edges are ordered pairs of vertices. So (1, 3 and (3, 1 are considered different edges. We also allow loops : edges (v, w where v = w Warning: This is not quite the same as the problem we discussed in class because we are allowed to have both (u, v and (v, w. (In class I only allowed one of the two. So it is very similar, but the answers are different, (a How many directed graphs on [n] are there? 2 n2. (b How many directed graphs on [n] have edges (including loops? 2. (c How many directed graphs on [n] have the property that vertex n is not in any edge? 2 (n For each of the following, determine the number of wals with the stated properties, where each step in the wal is either one to the right or one up. (a The wal begins at 0, 0 and ends at (n, n ( 2n n (b The wal begins at 0, 0, ends at (2n, 2n, and passes through (n, n. ( 2n n 2 4
5 (c The wal begins at 0, 0, ends at (2n, 2n, and does not through (n, n. ( 4n ( 2n 2n 2 n 6. Find a recurrence for the number of ways to tile a 1 n board with 1 1 squares and 1 2 dominos, given that the squares come in x colors and the dominoes come in y colors. a 1 = x, a 2 = x 2 + y; for n > 2, a n = xa n 1 + ya n Explain why there cannot be integers x and y such that 4x 2 + 2y 10 16y 3 x = 5. Left side is even, right side is odd. 8. What is the remainder when is divided by 7? No electronic devices permitted. Hint: 2 5 mod 7. zero ( = ( = Suppose F (x = n=0 a n x n = 5 1 4x x x (a Find an explicit formula for a n a n = 5 4 n n + ( 1 n (b Find a recurrence relation that the numbers a n satisfy. a 0 = 8, a 1 = 25, a 2 = 99, and for all n 3, a n = 6a n 1 5a n 2 12a n You are dealt 5 cards from a standard dec of cards. (a How many possibilities are there for the 5 card hand that you are dealt? (
6 (b How many of these possibilities include exactly three cards with the same single digit, but no other cards with numbers. (So, for example, we count the hand {A, 3, 3, 3, K }, but not the hand {A, 10, 10, 10, K }, and not {A, 3, 3, 3, 5 }. The number of cards that are not numbers is 4 4 = 16, so we get 8 (4 16 3( Suppose 5 decs of cards are shuffled together, and you are dealt a five card hand. How many possibilities are there for the multiset of 5 cards that you are dealt? Let X i be the number of copies of card i. The number of solutions to 52 X i = 5 is ( ( = 56 i= Let A be the set of all solutions to the equation X 1 + X 2 + X 3 = 100, where each X i is a non-negative integer. Let B be the set of all solutions to the equation Y 1 + Y 2 + Y 3 + Y 4 = 200 where each Y i is an integer and Y 1 1, Y 2 2, Y 3 3 and Y 4 = 94. (a Carefully define a bijection F : A B. Also define its inverse G : B A. F ((X 1, X 2, X 3 = (X 1 + 1, X 2 + 2, X 3 + 3, 94. G(Y 1, Y 2, Y 3, Y 4 = (Y 1 1, Y 2 1, Y 3 1 (b What is F ((3, 0, 97? (4, 2, 100, 94 (c What is G((4, 2, 100, 94? (3, 0, You begin at the center of a chess board and wal until you reach one of the four corners of the board. The rules are that each step involves traversing one side of a square, beginning wherever you are (So, unless you are at the edge of the board, there are four choices of which direction to tae. Let a n be the number of wals of length n. Show that a n is even for all positive integers n. Is a n 0 mod 4? 6
7 Let b NE n, b SE n, b SW n, b NE n repectively be the number of wals of length n that end at the upper right, lower right, lower left, and upper left corners of the board. Thus a n = b NE n + b SE n + b SW n + b NE n. If we draw the path traced by a NE wal, and rotate the board 90 degrees clocwise, the we get the path of a uniquely determined SE wal. Hence b NE = b SE. By a similar argument (rotate 180 or 270 degrees. b NE = b SW = b NW. Thus a n = 4b SE, a multiple of 4. Every multiple of 4 is even, so we have both a n 0 mod 4 and a n 0 mod Let a n be the number of simple labelled graphs on [n] in which each vertex has degree one. (a What is a 2017? Hint: 2017 is odd. a 2017 = 0 (b Find a recurrence relation that the numbers a n satisfy. a 1 = 0, a 2 = 1, and for all n 3, a n = (n 1a n 2. (c Find an exact formula for a n. m (2 1,if n = 2m a n = =1 0,if n is odd (d Prove that a 2m 2 m m! for all positive integers m. Use part (c and the inequality 2 1 < 2 : a 2m = m (2 1 =1 m (2 = 2 m =1 m =1 = 2 m m! 15. Let a n be the number of strings of length n over the alphabet {A, B, C, D} in which A never appears twice consecutively. 7
8 (a Find a recurrence relation that the numbers a n satisfy. a 1 = 4, a 2 = 15, and for all n 3, a n = 3a }{{ n 1 } + 3a }{{ n 2 } last not A ends in A (b Find an explicit formula for a n This one is unreasonably messy for hand computations. Sorry. 16. The binomial theorem asserts that, when (x + y n is expanded, the coefficient of x y n is ( n (a Prove it using induction First remember the identify ( ( m m 1 = 1 ( m 1 + that was proved in class using a bijective argument. Since ( ( 1 0 = 1 1 = 1, the base case (x + y 1 = 1 x y 1 is clear. =0 Assume, as the inductive hypothesis, that (x + y n = =0 (1 ( n x y n. (2 8
9 Then (x + y n+1 = (x + y(x + y n = x(x + y n + y(1 + x n ( n }{{} = x x j y n + y j I.H j=0 =0 ( n = x j+1 y n+1 (j+1 + j j=0 =0 n+1 ( n = x y n =1 =0 n+1 ( n n+1 = x y n =0 =0 x y n x y n+1 x y n+1 x y n The last step was a little tricy because of the limits of summation. In the first sum, we haven t really changed anything by adding and extra = 0 term because 1 = 0 Similarly the second ( sum is unchanged when we add an extra = n + 1 term because n n+1 = 0. The reason for fiddling with the indices is so that we can combine the two sums into one: n+1 (( n (x + y n+1 = + =0 ( n x y n+1 (3 1 Now we can simply apply the identity (1 with m = n + 1: n+1 ( n + 1 (x + y n+1 = x y n+1 (b Use it to show that 0 2 =0 =0 = 0 With x = 1, y = 1, we get ( n 0 n = ( 1 = even 2+1 ( n 1 + odd ( n ( 1 9
10 (c Use a bijection to prove the same fact. Define ϕ : P owerset([n] P owerset([n] by { S {n} if n S ϕ(s = S {n} if n S 17. If (x+y +z +w m is expanded, and lie terms are combined, how many nonzero terms will there be? Assuming the variables commute, this is just the number of solutions to X 1 + X 2 + X 3 + X 4 = m with each X i 0, namely ( ( 4+m = m
It is important that you show your work. There are 134 points available on this test.
Math 1165 Discrete Math Test April 4, 001 Your name It is important that you show your work There are 134 points available on this test 1 (10 points) Show how to tile the punctured chess boards below with
More informationDiscrete Math: Selected Homework Problems
Discrete Math: Selected Homework Problems 2006 2.1 Prove: if d is a common divisor of a and b and d is also a linear combination of a and b then d is a greatest common divisor of a and b. (5 3.1 Prove:
More informationAXIOMS FOR THE INTEGERS
AXIOMS FOR THE INTEGERS BRIAN OSSERMAN We describe the set of axioms for the integers which we will use in the class. The axioms are almost the same as what is presented in Appendix A of the textbook,
More informationDiscrete Mathematics for CS Spring 2008 David Wagner Note 13. An Introduction to Graphs
CS 70 Discrete Mathematics for CS Spring 2008 David Wagner Note 13 An Introduction to Graphs Formulating a simple, precise specification of a computational problem is often a prerequisite to writing a
More informationMC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points
MC 0 GRAPH THEORY 0// Solutions to HW # 0 points + XC points ) [CH] p.,..7. This problem introduces an important class of graphs called the hypercubes or k-cubes, Q, Q, Q, etc. I suggest that before you
More informationDiscrete Structures. Fall Homework3
Discrete Structures Fall 2015 Homework3 Chapter 5 1. Section 5.1 page 329 Problems: 3,5,7,9,11,15 3. Let P(n) be the statement that 1 2 + 2 2 + +n 2 = n(n + 1)(2n + 1)/6 for the positive integer n. a)
More informationChapter 3. Set Theory. 3.1 What is a Set?
Chapter 3 Set Theory 3.1 What is a Set? A set is a well-defined collection of objects called elements or members of the set. Here, well-defined means accurately and unambiguously stated or described. Any
More informationTILING RECTANGLES SIMON RUBINSTEIN-SALZEDO
TILING RECTANGLES SIMON RUBINSTEIN-SALZEDO. A classic tiling problem Question.. Suppose we tile a (large) rectangle with small rectangles, so that each small rectangle has at least one pair of sides with
More informationMath 575 Exam 3. (t). What is the chromatic number of G?
Math 575 Exam 3 Name 1 (a) Draw the Grötsch graph See your notes (b) Suppose that G is a graph having 6 vertices and 9 edges and that the chromatic polynomial of G is given below Fill in the missing coefficients
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8 An Introduction to Graphs Formulating a simple, precise specification of a computational problem is often a prerequisite
More informationDiscrete Mathematics Course Review 3
21-228 Discrete Mathematics Course Review 3 This document contains a list of the important definitions and theorems that have been covered thus far in the course. It is not a complete listing of what has
More informationLecture 5: Graphs. Rajat Mittal. IIT Kanpur
Lecture : Graphs Rajat Mittal IIT Kanpur Combinatorial graphs provide a natural way to model connections between different objects. They are very useful in depicting communication networks, social networks
More information1 Variations of the Traveling Salesman Problem
Stanford University CS26: Optimization Handout 3 Luca Trevisan January, 20 Lecture 3 In which we prove the equivalence of three versions of the Traveling Salesman Problem, we provide a 2-approximate algorithm,
More informationMAT 003 Brian Killough s Instructor Notes Saint Leo University
MAT 003 Brian Killough s Instructor Notes Saint Leo University Success in online courses requires self-motivation and discipline. It is anticipated that students will read the textbook and complete sample
More informationChapter 1. Math review. 1.1 Some sets
Chapter 1 Math review This book assumes that you understood precalculus when you took it. So you used to know how to do things like factoring polynomials, solving high school geometry problems, using trigonometric
More informationHMMT February 2018 February 10, 2018
HMMT February 2018 February 10, 2018 Combinatorics 1. Consider a 2 3 grid where each entry is one of 0, 1, and 2. For how many such grids is the sum of the numbers in every row and in every column a multiple
More informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Midterm 1
CS 70 Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Midterm 1 PRINT Your Name:, (last) SIGN Your Name: (first) PRINT Your Student ID: CIRCLE your exam room: 1 Pimentel 141 Mccone
More informationIndicate the option which most accurately completes the sentence.
Discrete Structures, CSCI 246, Fall 2015 Final, Dec. 10 Indicate the option which most accurately completes the sentence. 1. Say that Discrete(x) means that x is a discrete structures exam and Well(x)
More informationSums and Geometry + =
Sums and Geometry Main idea: we will compute formulas for sums of consecutive numbers, or powers of consecutive numbers, and other related sums, by expressing them geometrically and trying to visualize
More informationMAT 243 Test 2 SOLUTIONS, FORM A
MAT 243 Test 2 SOLUTIONS, FORM A 1. [15 points] Calculate the following quantities: a. 17 mod 4 Solution: 17 17 4 = 17 4 4 = 1. 4 b. 17 div 4 17 Solution: = 4. 4 c. (( 1) mod 12) mod (27 div 5) Solution:
More informationDO NOT RE-DISTRIBUTE THIS SOLUTION FILE
Professor Kindred Math 104, Graph Theory Homework 2 Solutions February 7, 2013 Introduction to Graph Theory, West Section 1.2: 26, 38, 42 Section 1.3: 14, 18 Section 2.1: 26, 29, 30 DO NOT RE-DISTRIBUTE
More informationDiscrete mathematics , Fall Instructor: prof. János Pach
Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,
More informationSection 1.8. Simplifying Expressions
Section 1.8 Simplifying Expressions But, first Commutative property: a + b = b + a; a * b = b * a Associative property: (a + b) + c = a + (b + c) (a * b) * c = a * (b * c) Distributive property: a * (b
More informationOn the Number of Tilings of a Square by Rectangles
University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange University of Tennessee Honors Thesis Projects University of Tennessee Honors Program 5-2012 On the Number of Tilings
More informationAMS /672: Graph Theory Homework Problems - Week V. Problems to be handed in on Wednesday, March 2: 6, 8, 9, 11, 12.
AMS 550.47/67: Graph Theory Homework Problems - Week V Problems to be handed in on Wednesday, March : 6, 8, 9,,.. Assignment Problem. Suppose we have a set {J, J,..., J r } of r jobs to be filled by a
More informationBulgarian Math Olympiads with a Challenge Twist
Bulgarian Math Olympiads with a Challenge Twist by Zvezdelina Stankova Berkeley Math Circle Beginners Group September 0, 03 Tasks throughout this session. Harder versions of problems from last time appear
More informationCardinality of Sets. Washington University Math Circle 10/30/2016
Cardinality of Sets Washington University Math Circle 0/0/06 The cardinality of a finite set A is just the number of elements of A, denoted by A. For example, A = {a, b, c, d}, B = {n Z : n } = {,,, 0,,,
More informationTo illustrate what is intended the following are three write ups by students. Diagonalization
General guidelines: You may work with other people, as long as you write up your solution in your own words and understand everything you turn in. Make sure to justify your answers they should be clear
More informationDiscrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7
CS 70 Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7 An Introduction to Graphs A few centuries ago, residents of the city of Königsberg, Prussia were interested in a certain problem.
More informationCHAPTER 2. Graphs. 1. Introduction to Graphs and Graph Isomorphism
CHAPTER 2 Graphs 1. Introduction to Graphs and Graph Isomorphism 1.1. The Graph Menagerie. Definition 1.1.1. A simple graph G = (V, E) consists of a set V of vertices and a set E of edges, represented
More informationProblem Set 7 Solutions
6.42/8.62J Mathematics for Computer Science March 29, 25 Srini Devadas and Eric Lehman Problem Set 7 Solutions Due: Monday, April 4 at 9 PM Problem. Every function has some subset of these properties:
More informationIntroduction to Modular Arithmetic
Randolph High School Math League 2014-2015 Page 1 1 Introduction Introduction to Modular Arithmetic Modular arithmetic is a topic residing under Number Theory, which roughly speaking is the study of integers
More informationLECTURES 3 and 4: Flows and Matchings
LECTURES 3 and 4: Flows and Matchings 1 Max Flow MAX FLOW (SP). Instance: Directed graph N = (V,A), two nodes s,t V, and capacities on the arcs c : A R +. A flow is a set of numbers on the arcs such that
More informationCS473-Algorithms I. Lecture 13-A. Graphs. Cevdet Aykanat - Bilkent University Computer Engineering Department
CS473-Algorithms I Lecture 3-A Graphs Graphs A directed graph (or digraph) G is a pair (V, E), where V is a finite set, and E is a binary relation on V The set V: Vertex set of G The set E: Edge set of
More informationMath 187 Sample Test II Questions
Math 187 Sample Test II Questions Dr. Holmes October 2, 2008 These are sample questions of kinds which might appear on Test II. There is no guarantee that all questions on the test will look like these!
More informationCS 341 Homework 1 Basic Techniques
CS 341 Homework 1 Basic Techniques 1. What are these sets? Write them using braces, commas, numerals, (for infinite sets), and only. (a) ({1, 3, 5} {3, 1}) {3, 5, 7} (b) {{3}, {3, 5}, {{5, 7}, {7, 9}}}
More information1. Draw the state graphs for the finite automata which accept sets of strings composed of zeros and ones which:
P R O B L E M S Finite Autom ata. Draw the state graphs for the finite automata which accept sets of strings composed of zeros and ones which: a) Are a multiple of three in length. b) End with the string
More informationEDAA40 At home exercises 1
EDAA40 At home exercises 1 1. Given, with as always the natural numbers starting at 1, let us define the following sets (with iff ): Give the number of elements in these sets as follows: 1. 23 2. 6 3.
More informationChapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings
Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 12: Planar Graphs Math 184A / Fall 2017 1 / 45 12.1 12.2. Planar graphs Definition
More informationMath 776 Graph Theory Lecture Note 1 Basic concepts
Math 776 Graph Theory Lecture Note 1 Basic concepts Lectured by Lincoln Lu Transcribed by Lincoln Lu Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved
More informationCounting the number of spanning tree. Pied Piper Department of Computer Science and Engineering Shanghai Jiao Tong University
Counting the number of spanning tree Pied Piper Department of Computer Science and Engineering Shanghai Jiao Tong University 目录 Contents 1 Complete Graph 2 Proof of the Lemma 3 Arbitrary Graph 4 Proof
More informationFinal Exam Math 38 Graph Theory Spring 2017 Due on Friday, June 2, at 12:50 pm. Good Luck!!
Final Exam Math 38 Graph Theory Spring 2017 Due on Friday, June 2, at 12:50 pm NAME: Instructions: You can use the textbook (Doug West s Introduction to Graph Theory, without solutions), your notes from
More informationEvolution Module. 6.1 Phylogenetic Trees. Bob Gardner and Lev Yampolski. Integrated Biology and Discrete Math (IBMS 1300)
Evolution Module 6.1 Phylogenetic Trees Bob Gardner and Lev Yampolski Integrated Biology and Discrete Math (IBMS 1300) Fall 2008 1 INDUCTION Note. The natural numbers N is the familiar set N = {1, 2, 3,...}.
More informationCPS 102: Discrete Mathematics. Quiz 3 Date: Wednesday November 30, Instructor: Bruce Maggs NAME: Prob # Score. Total 60
CPS 102: Discrete Mathematics Instructor: Bruce Maggs Quiz 3 Date: Wednesday November 30, 2011 NAME: Prob # Score Max Score 1 10 2 10 3 10 4 10 5 10 6 10 Total 60 1 Problem 1 [10 points] Find a minimum-cost
More informationCSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 7: Direct Proof Introduction 1. The statement below is true. Rewrite the
More informationAn Introduction to Combinatorics and Graph Theory. David Guichard
An Introduction to Combinatorics and Graph Theory David Guichard This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/3.0/
More informationLet v be a vertex primed by v i (s). Then the number f(v) of neighbours of v which have
Let v be a vertex primed by v i (s). Then the number f(v) of neighbours of v which have been red in the sequence up to and including v i (s) is deg(v)? s(v), and by the induction hypothesis this sequence
More informationPACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS
PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PAUL BALISTER Abstract It has been shown [Balister, 2001] that if n is odd and m 1,, m t are integers with m i 3 and t i=1 m i = E(K n) then K n can be decomposed
More informationGraph Theory S 1 I 2 I 1 S 2 I 1 I 2
Graph Theory S I I S S I I S Graphs Definition A graph G is a pair consisting of a vertex set V (G), and an edge set E(G) ( ) V (G). x and y are the endpoints of edge e = {x, y}. They are called adjacent
More informationMath 443/543 Graph Theory Notes
Math 443/543 Graph Theory Notes David Glickenstein September 3, 2008 1 Introduction We will begin by considering several problems which may be solved using graphs, directed graphs (digraphs), and networks.
More informationBasic Combinatorics. Math 40210, Section 01 Fall Homework 4 Solutions
Basic Combinatorics Math 40210, Section 01 Fall 2012 Homework 4 Solutions 1.4.2 2: One possible implementation: Start with abcgfjiea From edge cd build, using previously unmarked edges: cdhlponminjkghc
More informationSolution to Graded Problem Set 4
Graph Theory Applications EPFL, Spring 2014 Solution to Graded Problem Set 4 Date: 13.03.2014 Due by 18:00 20.03.2014 Problem 1. Let V be the set of vertices, x be the number of leaves in the tree and
More informationChapter Summary. Mathematical Induction Recursive Definitions Structural Induction Recursive Algorithms
Chapter Summary Mathematical Induction Recursive Definitions Structural Induction Recursive Algorithms Section 5.1 Sec.on Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken
More information2. CONNECTIVITY Connectivity
2. CONNECTIVITY 70 2. Connectivity 2.1. Connectivity. Definition 2.1.1. (1) A path in a graph G = (V, E) is a sequence of vertices v 0, v 1, v 2,..., v n such that {v i 1, v i } is an edge of G for i =
More informationFigure 4.1: The evolution of a rooted tree.
106 CHAPTER 4. INDUCTION, RECURSION AND RECURRENCES 4.6 Rooted Trees 4.6.1 The idea of a rooted tree We talked about how a tree diagram helps us visualize merge sort or other divide and conquer algorithms.
More informationCalculating Cardinalities
Math Circle Monday March 20, 2017 Calculating Cardinalities Martin Zeman To say that a set A has 5 elements means that we can write the elements of A as a list a 1, a 2, a 3, a 4, a 5 in a way that (a)
More informationHOMEWORK #4 SOLUTIONS - MATH 4160
HOMEWORK #4 SOLUTIONS - MATH 4160 DUE: FRIDAY MARCH 7, 2002 AT 10:30AM Enumeration problems. (1 How many different ways are there of labeling the vertices of the following trees so that the graphs are
More informationCS70: Discrete Math and Probability. Fan Ye June 23, 2016
CS70: Discrete Math and Probability Fan Ye June 23, 2016 More inductions! Bunch of examples Good ones and bad ones 1 More inductions Suppose I start with 0 written on a piece of paper. Each time, I choose
More information4&5 Binary Operations and Relations. The Integers. (part I)
c Oksana Shatalov, Spring 2016 1 4&5 Binary Operations and Relations. The Integers. (part I) 4.1: Binary Operations DEFINITION 1. A binary operation on a nonempty set A is a function from A A to A. Addition,
More informationBasic Properties The Definition of Catalan Numbers
1 Basic Properties 1.1. The Definition of Catalan Numbers There are many equivalent ways to define Catalan numbers. In fact, the main focus of this monograph is the myriad combinatorial interpretations
More informationIntroduction III. Graphs. Motivations I. Introduction IV
Introduction I Graphs Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Graph theory was introduced in the 18th century by Leonhard Euler via the Königsberg
More informationSolutions to Homework 10
CS/Math 240: Intro to Discrete Math 5/3/20 Instructor: Dieter van Melkebeek Solutions to Homework 0 Problem There were five different languages in Problem 4 of Homework 9. The Language D 0 Recall that
More informationPhil 320 Chapter 1: Sets, Functions and Enumerability I. Sets Informally: a set is a collection of objects. The objects are called members or
Phil 320 Chapter 1: Sets, Functions and Enumerability I. Sets Informally: a set is a collection of objects. The objects are called members or elements of the set. a) Use capital letters to stand for sets
More informationNotebook Assignments
Notebook Assignments These six assignments are a notebook using techniques from class in the single concrete context of graph theory. This is supplemental to your usual assignments, and is designed for
More informationAn Introduction to Combinatorics and Graph Theory. David Guichard
An Introduction to Combinatorics and Graph Theory David Guichard This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/3.0/
More informationMathematics. Jaehyun Park. CS 97SI Stanford University. June 29, 2015
Mathematics Jaehyun Park CS 97SI Stanford University June 29, 2015 Outline Algebra Number Theory Combinatorics Geometry Algebra 2 Sum of Powers n k=1 k 3 k 2 = 1 n(n + 1)(2n + 1) 6 = ( k ) 2 = ( 1 2 n(n
More informationSAT Timed Section*: Math
SAT Timed Section*: Math *These practice questions are designed to be taken within the specified time period without interruption in order to simulate an actual SAT section as much as possible. Time --
More information2009 HMMT Team Round. Writing proofs. Misha Lavrov. ARML Practice 3/2/2014
Writing proofs Misha Lavrov ARML Practice 3/2/2014 Warm-up / Review 1 (From my research) If x n = 2 1 x n 1 for n 2, solve for x n in terms of x 1. (For a more concrete problem, set x 1 = 2.) 2 (From this
More informationSlides for Faculty Oxford University Press All rights reserved.
Oxford University Press 2013 Slides for Faculty Assistance Preliminaries Author: Vivek Kulkarni vivek_kulkarni@yahoo.com Outline Following topics are covered in the slides: Basic concepts, namely, symbols,
More informationSolutions to the Second Midterm Exam
CS/Math 240: Intro to Discrete Math 3/27/2011 Instructor: Dieter van Melkebeek Solutions to the Second Midterm Exam Problem 1 This question deals with the following implementation of binary search. Function
More informationCS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK
CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1 UNIT I INTRODUCTION CS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK 1. Define Graph. 2. Define Simple graph. 3. Write few problems
More informationSummary of Course Coverage
CS-227, Discrete Structures I Spring 2006 Semester Summary of Course Coverage 1) Propositional Calculus a) Negation (logical NOT) b) Conjunction (logical AND) c) Disjunction (logical inclusive-or) d) Inequalities
More informationComplexity, Induction, and Recurrence Relations. CSE 373 Help Session 4/7/2016
Complexity, Induction, and Recurrence Relations CSE 373 Help Session 4/7/2016 Big-O Definition Definition: g(n) is in O( f(n) ) if there exist positive constants c and n0 such that g(n) c f(n) for all
More informationBasics of Graph Theory
Basics of Graph Theory 1 Basic notions A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. Simple graphs have their
More information2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into
2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into the viewport of the current application window. A pixel
More informationProposition 1. The edges of an even graph can be split (partitioned) into cycles, no two of which have an edge in common.
Math 3116 Dr. Franz Rothe June 5, 2012 08SUM\3116_2012t1.tex Name: Use the back pages for extra space 1 Solution of Test 1.1 Eulerian graphs Proposition 1. The edges of an even graph can be split (partitioned)
More informationMath 443/543 Graph Theory Notes
Math 443/543 Graph Theory Notes David Glickenstein September 8, 2014 1 Introduction We will begin by considering several problems which may be solved using graphs, directed graphs (digraphs), and networks.
More informationMC302 GRAPH THEORY SOLUTIONS TO HOMEWORK #1 9/19/13 68 points + 6 extra credit points
MC02 GRAPH THEORY SOLUTIONS TO HOMEWORK #1 9/19/1 68 points + 6 extra credit points 1. [CH] p. 1, #1... a. In each case, for the two graphs you say are isomorphic, justify it by labeling their vertices
More informationMath 778S Spectral Graph Theory Handout #2: Basic graph theory
Math 778S Spectral Graph Theory Handout #: Basic graph theory Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved the Königsberg Bridge problem: Is it possible
More informationCS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague December 16, CS1800 Discrete Structures Final
CS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague December 16, 2016 Instructions: CS1800 Discrete Structures Final 1. The exam is closed book and closed notes. You may
More informationCS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague December 16, CS1800 Discrete Structures Final
CS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague December 16, 2016 Instructions: CS1800 Discrete Structures Final 1. The exam is closed book and closed notes. You may
More informationVarying Applications (examples)
Graph Theory Varying Applications (examples) Computer networks Distinguish between two chemical compounds with the same molecular formula but different structures Solve shortest path problems between cities
More informationChapter 4. square sum graphs. 4.1 Introduction
Chapter 4 square sum graphs In this Chapter we introduce a new type of labeling of graphs which is closely related to the Diophantine Equation x 2 + y 2 = n and report results of our preliminary investigations
More information1 Some Solution of Homework
Math 3116 Dr. Franz Rothe May 30, 2012 08SUM\3116_2012h1.tex Name: Use the back pages for extra space 1 Some Solution of Homework Proposition 1 (Counting labeled trees). There are n n 2 different labeled
More informationpoints are stationed arbitrarily close to one corner of the square ( n+1
1 Intro We ve seen previously that we can construct networks based on the regular triangular, rectangular and hexagonal lattices where the total network length is linear in n and the R-statistic for the
More informationDefinition For vertices u, v V (G), the distance from u to v, denoted d(u, v), in G is the length of a shortest u, v-path. 1
Graph fundamentals Bipartite graph characterization Lemma. If a graph contains an odd closed walk, then it contains an odd cycle. Proof strategy: Consider a shortest closed odd walk W. If W is not a cycle,
More informationCS70 - Lecture 6. Graphs: Coloring; Special Graphs. 1. Review of L5 2. Planar Five Color Theorem 3. Special Graphs:
CS70 - Lecture 6 Graphs: Coloring; Special Graphs 1. Review of L5 2. Planar Five Color Theorem 3. Special Graphs: Trees: Three characterizations Hypercubes: Strongly connected! Administration You need
More informationAnswers to specimen paper questions. Most of the answers below go into rather more detail than is really needed. Please let me know of any mistakes.
Answers to specimen paper questions Most of the answers below go into rather more detail than is really needed. Please let me know of any mistakes. Question 1. (a) The degree of a vertex x is the number
More informationNorth Bank. West Island. East Island. South Bank
Lecture 11 Eulerian Multigraphs This section of the notes revisits the Königsberg Bridge Problem and generalises it to explore Eulerian multigraphs: those that contain a closed walk that traverses every
More informationLecture 20 : Trees DRAFT
CS/Math 240: Introduction to Discrete Mathematics 4/12/2011 Lecture 20 : Trees Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last time we discussed graphs. Today we continue this discussion,
More informationPractice Final Exam Solutions
1 (1 points) For the following problem, the alphabet used is the standard -letter English alphabet, and vowels refers only to the letters A, E, I, O, and U (a) ( points) How many strings of five letters
More information1. Suppose you are given a magic black box that somehow answers the following decision problem in polynomial time:
1. Suppose you are given a magic black box that somehow answers the following decision problem in polynomial time: Input: A CNF formula ϕ with n variables x 1, x 2,..., x n. Output: True if there is an
More informationMath 4410 Fall 2010 Exam 3. Show your work. A correct answer without any scratch work or justification may not receive much credit.
Math 4410 Fall 2010 Exam 3 Name: Directions: Complete all six questions. Show your work. A correct answer without any scratch work or justification may not receive much credit. You may not use any notes,
More informationCPSC 536N: Randomized Algorithms Term 2. Lecture 10
CPSC 536N: Randomized Algorithms 011-1 Term Prof. Nick Harvey Lecture 10 University of British Columbia In the first lecture we discussed the Max Cut problem, which is NP-complete, and we presented a very
More informationCS 97SI: INTRODUCTION TO PROGRAMMING CONTESTS. Jaehyun Park
CS 97SI: INTRODUCTION TO PROGRAMMING CONTESTS Jaehyun Park Today s Lecture Algebra Number Theory Combinatorics (non-computational) Geometry Emphasis on how to compute Sum of Powers n k=1 k 2 = 1 6 n(n
More informationExercise set 2 Solutions
Exercise set 2 Solutions Let H and H be the two components of T e and let F E(T ) consist of the edges of T with one endpoint in V (H), the other in V (H ) Since T is connected, F Furthermore, since T
More informationr=1 The Binomial Theorem. 4 MA095/98G Revision
Revision Read through the whole course once Make summary sheets of important definitions and results, you can use the following pages as a start and fill in more yourself Do all assignments again Do the
More informationIntegrated Math, Part C Chapter 1 SUPPLEMENTARY AND COMPLIMENTARY ANGLES
Integrated Math, Part C Chapter SUPPLEMENTARY AND COMPLIMENTARY ANGLES Key Concepts: By the end of this lesson, you should understand:! Complements! Supplements! Adjacent Angles! Linear Pairs! Vertical
More informationASSIGNMENT 4 SOLUTIONS
MATH 71 ASSIGNMENT SOLUTIONS 1. If F : X X is a function, define f (x) to be (f f)(x), and inductively define f k (x) (f f k 1 )(x) for each integer k. (So f (x) (f f )(x) f(f(f(x))) for instance.) We
More informationA.1 Numbers, Sets and Arithmetic
522 APPENDIX A. MATHEMATICS FOUNDATIONS A.1 Numbers, Sets and Arithmetic Numbers started as a conceptual way to quantify count objects. Later, numbers were used to measure quantities that were extensive,
More information