# Discrete Mathematics | ![img \|150](https://upload.wikimedia.org/wikipedia/commons/thumb/5/5b/6n-graf.svg/320px-6n-graf.svg.png) | **Discrete Mathematics** is the study of mathematical structures that can be considered "discrete" rather than "continuous". Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics" such as real numbers, calculus or Euclidean geometry. Discrete objects can often be enumerated by integers; more formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets. However, there is no exact definition of the term "discrete mathematics". | |-|-| | | wikipedia:: [Discrete mathematics](https://en.wikipedia.org/wiki/Discrete_mathematics) | discrete numbers have some kind of bijection vs continuous numbers that do not [[Game Theory]] [[Graph theory]], [[Topology]] Routing problems like [[Travelling salesman problem]] [[Voting System]] and their criteria [[Continuous Mathematics]]