Culture · Geography · Health · History · Mathematics · Natural sciences · Philosophy · Religion · Society · Technology
editDiscrete mathematics, also called finite mathematics or decision mathematics, is the study of mathematical structures that are fundamentally discrete in the sense of not supporting or requiring the notion of continuity. Objects studied in finite mathematics are largely countable sets such as integers, finite graphs, and formal languages.
Discrete mathematics has become popular in recent decades because of its applications to computer science. Concepts and notations from discrete mathematics are useful to study or describe objects or problems in computer algorithms and programming languages. In some mathematics curricula, finite mathematics courses cover discrete mathematical concepts for business, while discrete mathematics courses emphasize concepts for computer science majors.
Read more Show new selections edit
![]() |
A 1-forest (a maximal pseudoforest), formed by three 1-trees |
In graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of vertices, such that no two closed paths of consecutive edges share any vertex with each other, nor can any two such closed paths be connected to each other by a path of consecutive edges. A pseudotree is a connected pseudoforest.
The names are justified by analogy to the more commonly studied trees and forests. (A tree is a connected graph with no cycles; a forest is a disjoint union of trees.) Gabow and Tarjan attribute the naming of pseudoforests to Dantzig's 1963 book on linear programming, in which pseudoforests arise in the solution of certain network flow problems. Pseudoforests also form graph-theoretic models of functions and occur in several algorithmic problems. Pseudoforests are sparse graphs – they have very few edges relative to their number of vertices – and their matroid structure allows several other families of sparse graphs to be decomposed as unions of forests and pseudoforests.
...Archive | Image credit: User:David Eppstein | Read more... |
The Mathematics WikiProject is the center for mathematics-related editing on Wikipedia. Join the discussion on the project's talk page.
Project pages
Subprojects
Related projects
Computer science | Cryptography | Game theory | Numbers | Physics | Science edit...Archive | Image credit: xJaM | Read more... |
Major areas | Combinatorics | Graph Theory | Game theory |
---|---|---|---|
|
|
|
|
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
|
Algebra | Analysis | Category theory |
Computer science |
Cryptography | Discrete mathematics |
Geometry | |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
Logic | Mathematics | Number theory |
Physics | Science | Set theory | Statistics | Topology |
Discrete mathematics on Wikinews | Discrete mathematics on Wikiquote | Discrete mathematics on Wikibooks | Discrete mathematics on Wikisource | Discrete mathematics on Wiktionary | Discrete mathematics on Wikiversity | Discrete mathematics on Wikimedia Commons |
News | Quotations | Manuals & Texts | Texts | Definitions | Learning resources | Images & Media |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
Purge server cache