Sign up
Forgot password?
FAQ: Login

Mašulović D. The Discrete Charm of Discrete Mathematics

  • pdf file
  • size 1,01 MB
  • added by
  • info modified
Mašulović D. The Discrete Charm of Discrete Mathematics
Johannes Kepler University, Linz, 2006. — 164 p.
The objective of the course is to provide an overview of the main topics and techniques of Discrete Mathematics. The emphasis will be on the investigation of the most fundamental combinatorial structures. In this course we address some of the most importand topics in Discrete Mathematics: elementary combinatorial configurations (permutations and variations) and basic counting; systems of distinct representatives and latin squares; combinatorial designs and finite geometries; eulerian and Hamiltonian graphs and NP-hard problems; planarity and the Four Colour Problem.
Words and Sets
Blocks and Cycles
SDRs and Latin Squares
Finite Geometries and Designs
Graphs and Digraphs
Eulerian and Hamiltonian graphs
Planar graphs
Graph colourings
  • Sign up or login using form at top of the page to download this file.
  • Sign up
Up