OurBigBook Wikipedia Bot
Documentation
Discrete mathematics
OurBigBook Wikipedia Bot
Mathematics
Fields of mathematics
toc
wiki
nosplit
articles:
243
Table of contents
243
1. Discrete geometry
link
nosplit
Discrete mathematics
178
1.1. Digital geometry
link
nosplit
Discrete geometry
32
1.1.1. Azriel Rosenfeld
link
nosplit
Digital geometry
1.1.2. Binary image
link
nosplit
Digital geometry
1.1.3. Bresenham's line algorithm
link
nosplit
Digital geometry
1.1.4. Canberra distance
link
nosplit
Digital geometry
1.1.5. Closing (morphology)
link
nosplit
Digital geometry
1.1.6. Controlled image base
link
nosplit
Digital geometry
1.1.7. Digital differential analyzer (graphics algorithm)
link
nosplit
Digital geometry
1.1.8. Digital image
link
nosplit
Digital geometry
1.1.9. Dilation (morphology)
link
nosplit
Digital geometry
1.1.10. Distance transform
link
nosplit
Digital geometry
1.1.11. Erosion (morphology)
link
nosplit
Digital geometry
1.1.12. Euler operator (digital geometry)
link
nosplit
Digital geometry
1.1.13. Gradually varied surface
link
nosplit
Digital geometry
1.1.14. Hit-or-miss transform
link
nosplit
Digital geometry
1.1.15. LCD crosstalk
link
nosplit
Digital geometry
1.1.16. Mathematical morphology
link
nosplit
Digital geometry
1.1.17. Midpoint circle algorithm
link
nosplit
Digital geometry
1.1.18. Morphological gradient
link
nosplit
Digital geometry
1.1.19. Morphological skeleton
link
nosplit
Digital geometry
1.1.20. Nonogram
link
nosplit
Digital geometry
1.1.21. Pick's theorem
link
nosplit
Digital geometry
1.1.22. Pixel
link
nosplit
Digital geometry
1.1.23. Pixel aspect ratio
link
nosplit
Digital geometry
1.1.24. Pruning (morphology)
link
nosplit
Digital geometry
1.1.25. Raster graphics
link
nosplit
Digital geometry
1.1.26. Reeve tetrahedra
link
nosplit
Digital geometry
1.1.27. SPHARM-PDM
link
nosplit
Digital geometry
1.1.28. Summed-area table
link
nosplit
Digital geometry
1.1.29. Taxicab geometry
link
nosplit
Digital geometry
1.1.30. Thinning (morphology)
link
nosplit
Digital geometry
1.1.31. Top-hat transform
link
nosplit
Digital geometry
1.1.32. Topological skeleton
link
nosplit
Digital geometry
1.2. Lattice points
link
nosplit
Discrete geometry
26
1.2.1. Geometry of numbers
link
nosplit
Lattice points
1.2.2. Bragg plane
link
nosplit
Lattice points
1.2.3. Bravais lattice
link
nosplit
Lattice points
1.2.4. Computing the Continuous Discretely
link
nosplit
Lattice points
1.2.5. Divisor summatory function
link
nosplit
Lattice points
1.2.6. Doignon's theorem
link
nosplit
Lattice points
1.2.7. Dot planimeter
link
nosplit
Lattice points
1.2.8. Double lattice
link
nosplit
Lattice points
1.2.9. E8 lattice
link
nosplit
Lattice points
1.2.10. Euclid's orchard
link
nosplit
Lattice points
1.2.11. Fokker periodicity block
link
nosplit
Lattice points
1.2.12. Gauss circle problem
link
nosplit
Lattice points
1.2.13. Hexagonal lattice
link
nosplit
Lattice points
1.2.14. Integer lattice
link
nosplit
Lattice points
1.2.15. Lattice (group)
link
nosplit
Lattice points
1.2.16. Leech lattice
link
nosplit
Lattice points
1.2.17. Meyer set
link
nosplit
Lattice points
1.2.18. Niemeier lattice
link
nosplit
Lattice points
1.2.19. Oblique lattice
link
nosplit
Lattice points
1.2.20. Poisson summation formula
link
nosplit
Lattice points
1.2.21. Reciprocal lattice
link
nosplit
Lattice points
1.2.22. Rectangular lattice
link
nosplit
Lattice points
1.2.23. Regular grid
link
nosplit
Lattice points
1.2.24. Schinzel's theorem
link
nosplit
Lattice points
1.2.25. Square lattice
link
nosplit
Lattice points
1.2.26. Unimodular lattice
link
nosplit
Lattice points
1.3. Mathematics of rigidity
link
nosplit
Discrete geometry
11
1.3.1. Beckman–Quarles theorem
link
nosplit
Mathematics of rigidity
1.3.2. Bricard octahedron
link
nosplit
Mathematics of rigidity
1.3.3. Cauchy's theorem (geometry)
link
nosplit
Mathematics of rigidity
1.3.4. Cayley configuration space
link
nosplit
Mathematics of rigidity
1.3.5. Counting on Frameworks
link
nosplit
Mathematics of rigidity
1.3.6. Flexible polyhedron
link
nosplit
Mathematics of rigidity
1.3.7. Laman graph
link
nosplit
Mathematics of rigidity
1.3.8. Parallel redrawing
link
nosplit
Mathematics of rigidity
1.3.9. Pseudotriangle
link
nosplit
Mathematics of rigidity
1.3.10. Steffen's polyhedron
link
nosplit
Mathematics of rigidity
1.3.11. Structural rigidity
link
nosplit
Mathematics of rigidity
1.4. Packing problems
link
nosplit
Discrete geometry
19
1.4.1. Bin packing
link
nosplit
Packing problems
1.4.2. Circle packing
link
nosplit
Packing problems
1.4.3. Apollonian sphere packing
link
nosplit
Packing problems
1.4.4. Cutting stock problem
link
nosplit
Packing problems
1.4.5. Ellipsoid packing
link
nosplit
Packing problems
1.4.6. Hoffman's packing puzzle
link
nosplit
Packing problems
1.4.7. Parallel task scheduling
link
nosplit
Packing problems
1.4.8. Polygon partition
link
nosplit
Packing problems
1.4.9. Rectangle packing
link
nosplit
Packing problems
1.4.10. Slothouber–Graatsma puzzle
link
nosplit
Packing problems
1.4.11. Smoothed octagon
link
nosplit
Packing problems
1.4.12. Sphere packing in a cube
link
nosplit
Packing problems
1.4.13. Sphere packing in a sphere
link
nosplit
Packing problems
1.4.14. Square packing
link
nosplit
Packing problems
1.4.15. Strip packing problem
link
nosplit
Packing problems
1.4.16. Tetrahedron packing
link
nosplit
Packing problems
1.4.17. The Pursuit of Perfect Packing
link
nosplit
Packing problems
1.4.18. Tripod packing
link
nosplit
Packing problems
1.4.19. Ulam's packing conjecture
link
nosplit
Packing problems
1.5. Theorems in discrete geometry
link
nosplit
Discrete geometry
13
1.5.1. Beck's theorem (geometry)
link
nosplit
Theorems in discrete geometry
1.5.2. Carathéodory's theorem (convex hull)
link
nosplit
Theorems in discrete geometry
1.5.3. De Bruijn's theorem
link
nosplit
Theorems in discrete geometry
1.5.4. Erdős–Anning theorem
link
nosplit
Theorems in discrete geometry
1.5.5. Erdős–Nagy theorem
link
nosplit
Theorems in discrete geometry
1.5.6. Four-vertex theorem
link
nosplit
Theorems in discrete geometry
1.5.7. Helly's theorem
link
nosplit
Theorems in discrete geometry
1.5.8. Kirchberger's theorem
link
nosplit
Theorems in discrete geometry
1.5.9. Krein–Milman theorem
link
nosplit
Theorems in discrete geometry
1.5.10. Monsky's theorem
link
nosplit
Theorems in discrete geometry
1.5.11. Radon's theorem
link
nosplit
Theorems in discrete geometry
1.5.12. Tverberg's theorem
link
nosplit
Theorems in discrete geometry
1.5.13. Wallace–Bolyai–Gerwien theorem
link
nosplit
Theorems in discrete geometry
1.6. Triangulation (geometry)
link
nosplit
Discrete geometry
19
1.6.1. Antiprism
link
nosplit
Triangulation (geometry)
1.6.2. Apollonian network
link
nosplit
Triangulation (geometry)
1.6.3. Bowyer–Watson algorithm
link
nosplit
Triangulation (geometry)
1.6.4. Constrained Delaunay triangulation
link
nosplit
Triangulation (geometry)
1.6.5. Delaunay refinement
link
nosplit
Triangulation (geometry)
1.6.6. Delaunay triangulation
link
nosplit
Triangulation (geometry)
1.6.7. Fan triangulation
link
nosplit
Triangulation (geometry)
1.6.8. Kinetic triangulation
link
nosplit
Triangulation (geometry)
1.6.9. Minimum-weight triangulation
link
nosplit
Triangulation (geometry)
1.6.10. Nonobtuse mesh
link
nosplit
Triangulation (geometry)
1.6.11. Pitteway triangulation
link
nosplit
Triangulation (geometry)
1.6.12. Point-set triangulation
link
nosplit
Triangulation (geometry)
1.6.13. Polygon triangulation
link
nosplit
Triangulation (geometry)
1.6.14. Quasi-triangulation
link
nosplit
Triangulation (geometry)
1.6.15. Rotation distance
link
nosplit
Triangulation (geometry)
1.6.16. Simplicial complex
link
nosplit
Triangulation (geometry)
1.6.17. Triangle mesh
link
nosplit
Triangulation (geometry)
1.6.18. Triangulated irregular network
link
nosplit
Triangulation (geometry)
1.6.19. Triangulation (topology)
link
nosplit
Triangulation (geometry)
1.7. Arrangement (space partition)
link
nosplit
Discrete geometry
1.8. Arrangement of lines
link
nosplit
Discrete geometry
1.9. Bellman's lost in a forest problem
link
nosplit
Discrete geometry
1.10. Big-line-big-clique conjecture
link
nosplit
Discrete geometry
1.11. Borsuk's conjecture
link
nosplit
Discrete geometry
1.12. Carpenter's rule problem
link
nosplit
Discrete geometry
1.13. Centroidal Voronoi tessellation
link
nosplit
Discrete geometry
1.14. Close-packing of equal spheres
link
nosplit
Discrete geometry
1.15. Combinatorial Geometry in the Plane
link
nosplit
Discrete geometry
1.16. Connective constant
link
nosplit
Discrete geometry
1.17. Covering problem of Rado
link
nosplit
Discrete geometry
1.18. Discrete & Computational Geometry
link
nosplit
Discrete geometry
1.19. Disk covering problem
link
nosplit
Discrete geometry
1.20. Dissection problem
link
nosplit
Discrete geometry
1.21. Equidissection
link
nosplit
Discrete geometry
1.22. Erdős distinct distances problem
link
nosplit
Discrete geometry
1.23. Erdős–Diophantine graph
link
nosplit
Discrete geometry
1.24. Hadwiger conjecture (combinatorial geometry)
link
nosplit
Discrete geometry
1.25. Hinged dissection
link
nosplit
Discrete geometry
1.26. Honeycomb conjecture
link
nosplit
Discrete geometry
1.27. Integer triangle
link
nosplit
Discrete geometry
1.28. Integrally convex set
link
nosplit
Discrete geometry
1.29. Isosceles set
link
nosplit
Discrete geometry
1.30. Kakeya set
link
nosplit
Discrete geometry
1.31. Kepler conjecture
link
nosplit
Discrete geometry
1.32. Kissing number
link
nosplit
Discrete geometry
1.33. Kobon triangle problem
link
nosplit
Discrete geometry
1.34. Lebesgue's universal covering problem
link
nosplit
Discrete geometry
1.35. List of shapes with known packing constant
link
nosplit
Discrete geometry
1.36. McMullen problem
link
nosplit
Discrete geometry
1.37. Moser's worm problem
link
nosplit
Discrete geometry
1.38. Mountain climbing problem
link
nosplit
Discrete geometry
1.39. Moving sofa problem
link
nosplit
Discrete geometry
1.40. Napkin folding problem
link
nosplit
Discrete geometry
1.41. Opaque set
link
nosplit
Discrete geometry
1.42. Orchard-planting problem
link
nosplit
Discrete geometry
1.43. Packing density
link
nosplit
Discrete geometry
1.44. Penrose tiling
link
nosplit
Discrete geometry
1.45. Pinwheel tiling
link
nosplit
Discrete geometry
1.46. Polycube
link
nosplit
Discrete geometry
1.47. Quaquaversal tiling
link
nosplit
Discrete geometry
1.48. Regular map (graph theory)
link
nosplit
Discrete geometry
1.49. Roberts's triangle theorem
link
nosplit
Discrete geometry
1.50. Sphere packing
link
nosplit
Discrete geometry
1.51. Sphere packing in a cylinder
link
nosplit
Discrete geometry
1.52. Squaring the square
link
nosplit
Discrete geometry
1.53. Straight skeleton
link
nosplit
Discrete geometry
1.54. Tarski's circle-squaring problem
link
nosplit
Discrete geometry
1.55. The Erdős Distance Problem
link
nosplit
Discrete geometry
1.56. Voronoi diagram
link
nosplit
Discrete geometry
1.57. Weighted Voronoi diagram
link
nosplit
Discrete geometry
1.58. Weyl's tile argument
link
nosplit
Discrete geometry
2. Theorems in discrete mathematics
link
nosplit
Discrete mathematics
56
2.1. Theorems in computational complexity theory
link
nosplit
Theorems in discrete mathematics
17
2.1.1. Blum's speedup theorem
link
nosplit
Theorems in computational complexity theory
2.1.2. Cook–Levin theorem
link
nosplit
Theorems in computational complexity theory
2.1.3. Fagin's theorem
link
nosplit
Theorems in computational complexity theory
2.1.4. Gap theorem
link
nosplit
Theorems in computational complexity theory
2.1.5. Karp–Lipton theorem
link
nosplit
Theorems in computational complexity theory
2.1.6. Linear speedup theorem
link
nosplit
Theorems in computational complexity theory
2.1.7. Master theorem (analysis of algorithms)
link
nosplit
Theorems in computational complexity theory
2.1.8. No free lunch in search and optimization
link
nosplit
Theorems in computational complexity theory
2.1.9. PCP theorem
link
nosplit
Theorems in computational complexity theory
2.1.10. Savitch's theorem
link
nosplit
Theorems in computational complexity theory
2.1.11. Schaefer's dichotomy theorem
link
nosplit
Theorems in computational complexity theory
2.1.12. Sipser–Lautemann theorem
link
nosplit
Theorems in computational complexity theory
2.1.13. Space hierarchy theorem
link
nosplit
Theorems in computational complexity theory
2.1.14. Speedup theorem
link
nosplit
Theorems in computational complexity theory
2.1.15. Time hierarchy theorem
link
nosplit
Theorems in computational complexity theory
2.1.16. Toda's theorem
link
nosplit
Theorems in computational complexity theory
2.1.17. Valiant–Vazirani theorem
link
nosplit
Theorems in computational complexity theory
2.2. Theorems in graph theory
link
nosplit
Theorems in discrete mathematics
30
2.2.1. Lemmas in graph theory
link
nosplit
Theorems in graph theory
2.2.2. 2-factor theorem
link
nosplit
Theorems in graph theory
2.2.3. Alspach's conjecture
link
nosplit
Theorems in graph theory
2.2.4. BEST theorem
link
nosplit
Theorems in graph theory
2.2.5. Cederbaum's maximum flow theorem
link
nosplit
Theorems in graph theory
2.2.6. Circle packing theorem
link
nosplit
Theorems in graph theory
2.2.7. Erdős–Gallai theorem
link
nosplit
Theorems in graph theory
2.2.8. Erdős–Pósa theorem
link
nosplit
Theorems in graph theory
2.2.9. Erdős–Stone theorem
link
nosplit
Theorems in graph theory
2.2.10. Even circuit theorem
link
nosplit
Theorems in graph theory
2.2.11. Fleischner's theorem
link
nosplit
Theorems in graph theory
2.2.12. Fulkerson–Chen–Anstee theorem
link
nosplit
Theorems in graph theory
2.2.13. Fáry's theorem
link
nosplit
Theorems in graph theory
2.2.14. Gale–Ryser theorem
link
nosplit
Theorems in graph theory
2.2.15. Geiringer–Laman theorem
link
nosplit
Theorems in graph theory
2.2.16. Graph structure theorem
link
nosplit
Theorems in graph theory
2.2.17. Grinberg's theorem
link
nosplit
Theorems in graph theory
2.2.18. Kotzig's theorem
link
nosplit
Theorems in graph theory
2.2.19. Kuratowski's theorem
link
nosplit
Theorems in graph theory
2.2.20. Max-flow min-cut theorem
link
nosplit
Theorems in graph theory
2.2.21. Ore's theorem
link
nosplit
Theorems in graph theory
2.2.22. Perfect graph theorem
link
nosplit
Theorems in graph theory
2.2.23. Planar separator theorem
link
nosplit
Theorems in graph theory
2.2.24. Robbins' theorem
link
nosplit
Theorems in graph theory
2.2.25. Robertson–Seymour theorem
link
nosplit
Theorems in graph theory
2.2.26. Schnyder's theorem
link
nosplit
Theorems in graph theory
2.2.27. Strong perfect graph theorem
link
nosplit
Theorems in graph theory
2.2.28. Turán's theorem
link
nosplit
Theorems in graph theory
2.2.29. Veblen's theorem
link
nosplit
Theorems in graph theory
2.2.30. Wagner's theorem
link
nosplit
Theorems in graph theory
2.3. Akra–Bazzi method
link
nosplit
Theorems in discrete mathematics
2.4. Analyst's traveling salesman theorem
link
nosplit
Theorems in discrete mathematics
2.5. Bregman–Minc inequality
link
nosplit
Theorems in discrete mathematics
2.6. Friedman's SSCG function
link
nosplit
Theorems in discrete mathematics
2.7. Holland's schema theorem
link
nosplit
Theorems in discrete mathematics
2.8. Kruskal's tree theorem
link
nosplit
Theorems in discrete mathematics
2.9. Parthasarathy's theorem
link
nosplit
Theorems in discrete mathematics
3. Cubicity
link
nosplit
Discrete mathematics
4. Direction-preserving function
link
nosplit
Discrete mathematics
5. Discrete fixed-point theorem
link
nosplit
Discrete mathematics
6. Fulkerson Prize
link
nosplit
Discrete mathematics
7. Inexact differential equation
link
nosplit
Discrete mathematics
8. Outline of discrete mathematics
link
nosplit
Discrete mathematics
9. Sphericity (graph theory)
link
nosplit
Discrete mathematics
Ancestors
Fields of mathematics
Mathematics
OurBigBook Wikipedia Bot