MATH-340: Discrete structures (II)
(2006)
Instructor Olga Kharlampovich
Dept. of Math. And Stats.
Ph: 398-3808 email: olga@math.mcgill.ca
Office hours W. 9:30-11:30 Burnside 926, or by appointment.
Place and time
Lectures: MWF 11:30-12:30, Burn 1B23
Tutorials:
Prerequisites: MATH 235 or MATH 240.
Corequisites: MATH 223 or MATH 236.
Textbook
There is one required text: K. Rosen Discrete Mathematics and its applications, fifth
edition. I will also use very often
N. Biggs, Discrete mathematics, second edition, Oxford U. Press. and
Course outline
A detailed outline will be available on the webpage. There are four sections in the
course.
1. Graph theory: connectivity, adjacency matrices , Euler circuits, Hamiltonian
cycles, trees and bipartite graphs, vertex and edge colouring, planar graphs,
spanning trees, the shortest path problem, matchings, isomorphism of graphs.
2. Combinatorics: functions and counting, counting injections, binomial coefficients
and the binomial theorem, inclusion-exclusion, Euler’s function, counting
surjections, partitions of a set.
3. Probability: conditional probability and independence, the Monty Hall problem,
quick-sort.
4. Introductory group theory, groups of permutations, isomorphisms and
automorphisms of graphs.
Final Grade: The final grade will be a letter grade, computed as
Max (Examination mark, (60% exam mark +25% midterm mark + 15% homework))
McGill University values academic integrity. Therefore all students
must understand the meaning and consequences of cheating, plagiarism and
other academic offences under the Code of Student Conduct and
Disciplinary Procedures (see http://www.mcgill.ca/integrity for more
information)