Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Graph (discrete mathematics) (view), Discrete Mathematics (journal) (view), SIAM Journal on Discrete Mathematics (view), Outline of discrete mathematics (view), Inversion (discrete mathematics) (view), Discrete Mathematics & Theoretical Computer Science (view), Discharging method (discrete mathematics) (view)

searching for Discrete mathematics 188 found (1704 total)

alternate case: discrete mathematics

Minimax (3,807 words) [view diff] no match in snippet view article find links to article

Minmax (sometimes Minimax, MM or saddle point) is a decision rule used in artificial intelligence, decision theory, game theory, statistics, and philosophy

Noisy-channel coding theorem (2,780 words) [view diff] no match in snippet view article find links to article

In information theory, the noisy-channel coding theorem (sometimes Shannon's theorem or Shannon's limit), establishes that for any given degree of noise

Cameron–Erdős conjecture (252 words) [view diff] case mismatch in snippet view article find links to article

Sapozhenko, Alexander A. (2008), "The Cameron-Erdős conjecture", Discrete Mathematics, 308 (19): 4361–4369, doi:10.1016/j.disc.2007.08.103, MR 2433862

Myhill–Nerode theorem (1,113 words) [view diff] no match in snippet view article find links to article

In the theory of formal languages, the Myhill–Nerode theorem provides a necessary and sufficient condition for a language to be regular. The theorem is

Gibbard–Satterthwaite theorem (2,660 words) [view diff] no match in snippet view article find links to article

The Gibbard–Satterthwaite theorem is a theorem in voting theory. It was first conjectured by the philosopher Michael Dummett and the mathematician Robin

Buchholz hydra (1,386 words) [view diff] no match in snippet view article find links to article

In mathematics, especially mathematical logic, graph theory and number theory, the Buchholz hydra game is a type of hydra game, which is a single-player

Fixed-point theorem (1,278 words) [view diff] no match in snippet view article find links to article

In mathematics, a fixed-point theorem is a result saying that a function F will have at least one fixed point (a point x for which F(x) = x), under some

Multiply perfect number (1,675 words) [view diff] case mismatch in snippet view article find links to article

"Bi-unitary multiperfect numbers, I" (PDF). Notes on Number Theory and Discrete Mathematics. 26 (1): 93–171. doi:10.7546/nntdm.2020.26.1.93-171. Haukkanen, Pentti;

Holland's schema theorem (844 words) [view diff] no match in snippet view article find links to article

Holland's schema theorem, also called the fundamental theorem of genetic algorithms, is an inequality that results from coarse-graining an equation for

Rado's theorem (Ramsey theory) (582 words) [view diff] no match in snippet view article

Rado's theorem is a theorem from the branch of mathematics known as Ramsey theory. It is named for the German mathematician Richard Rado. It was proved

Erdős–Szekeres theorem (1,174 words) [view diff] no match in snippet view article find links to article

In mathematics, the Erdős–Szekeres theorem asserts that, given r, s, any sequence of distinct real numbers with length at least (r − 1)(s − 1) + 1 contains

Holland's schema theorem (844 words) [view diff] no match in snippet view article find links to article

Holland's schema theorem, also called the fundamental theorem of genetic algorithms, is an inequality that results from coarse-graining an equation for

Erdős–Szekeres theorem (1,174 words) [view diff] no match in snippet view article find links to article

In mathematics, the Erdős–Szekeres theorem asserts that, given r, s, any sequence of distinct real numbers with length at least (r − 1)(s − 1) + 1 contains

Parthasarathy's theorem (485 words) [view diff] no match in snippet view article find links to article

In mathematics – and in particular the study of games on the unit square – Parthasarathy's theorem is a generalization of Von Neumann's minimax theorem

Star height problem (1,284 words) [view diff] no match in snippet view article find links to article

The star height problem in formal language theory is the question whether all regular languages can be expressed using regular expressions of limited star

Hales–Jewett theorem (1,771 words) [view diff] no match in snippet view article find links to article

In mathematics, the Hales–Jewett theorem is a fundamental combinatorial result of Ramsey theory named after Alfred W. Hales and Robert I. Jewett, concerning

Star of David theorem (406 words) [view diff] no match in snippet view article find links to article

The Star of David theorem is a mathematical result on arithmetic properties of binomial coefficients. It was discovered by Henry W. Gould in 1972. The

Alexander Schrijver (872 words) [view diff] exact match in snippet view article find links to article

is a Dutch mathematician and computer scientist, a professor of discrete mathematics and optimization at the University of Amsterdam and a fellow at the

Analyst's traveling salesman theorem (931 words) [view diff] no match in snippet view article find links to article

The analyst's traveling salesman problem is an analog of the traveling salesman problem in combinatorial optimization. In its simplest and original form

Arrow's impossibility theorem (4,194 words) [view diff] no match in snippet view article find links to article

Arrow's impossibility theorem is a key impossibility theorem in social choice theory, showing that no ranked voting rule can produce a logically coherent

Akra–Bazzi method (929 words) [view diff] no match in snippet view article find links to article

In computer science, the Akra–Bazzi method, or Akra–Bazzi theorem, is used to analyze the asymptotic behavior of the mathematical recurrences that appear

Curtis–Hedlund–Lyndon theorem (1,601 words) [view diff] no match in snippet view article find links to article

The Curtis–Hedlund–Lyndon theorem is a mathematical characterization of cellular automata in terms of their symbolic dynamics. It is named after Morton

Advanced level mathematics (1,338 words) [view diff] case mismatch in snippet view article find links to article

schools could choose freely between taking Statistics, Mechanics or Discrete Mathematics (also known as Decision Mathematics) modules with the ability to

Selected papers series of Knuth (234 words) [view diff] case mismatch in snippet view article find links to article

ISBN 1-57586-382-0. Donald Ervin Knuth (2003). Selected Papers on Discrete Mathematics. Stanford, California: Center for the Study of Language and Information

Joel Spencer (358 words) [view diff] exact match in snippet view article find links to article

Industrial and Applied Mathematics in 2017, "for contributions to discrete mathematics and theory of computing, particularly random graphs and networks

Large set (Ramsey theory) (429 words) [view diff] no match in snippet view article

In Ramsey theory, a set S of natural numbers is considered to be a large set if and only if Van der Waerden's theorem can be generalized to assert the

Folkman's theorem (763 words) [view diff] no match in snippet view article find links to article

Folkman's theorem is a theorem in mathematics, and more particularly in arithmetic combinatorics and Ramsey theory. According to this theorem, whenever

Erdős–Szemerédi theorem (3,168 words) [view diff] case mismatch in snippet view article find links to article

"The sum-product phenomenon in arbitrary rings", Contributions to Discrete Mathematics, 4 (2): 59–82, arXiv:0806.2497, Bibcode:2008arXiv0806.2497T, doi:10

Hausdorff Center for Mathematics (540 words) [view diff] case mismatch in snippet view article find links to article

Mathematics, Institute for Numerical Simulation, Research Institute for Discrete Mathematics), the Max Planck Institute for Mathematics (MPIM), and the Institute

Steven Skiena (719 words) [view diff] exact match in snippet view article find links to article

contributions to undergraduate education in the areas of algorithms and discrete mathematics and for influential textbook and software." Skiena has worked on

Arithmeum (205 words) [view diff] case mismatch in snippet view article find links to article

Forschungsinstitut für Diskrete Mathematik (Research Institute for Discrete Mathematics) at the University of Bonn. It was founded in 2008 by the director

Information Processing Letters (520 words) [view diff] exact match in snippet view article find links to article

computational biology, coding theory, theoretical cryptography, and applied discrete mathematics. Generally, submissions in all areas of scientific inquiry are considered

Erdős–Anning theorem (1,382 words) [view diff] no match in snippet view article find links to article

The Erdős–Anning theorem states that, whenever an infinite number of points in the plane all have integer distances, the points lie on a straight line

Sprague–Grundy theorem (3,332 words) [view diff] no match in snippet view article find links to article

In combinatorial game theory, the Sprague–Grundy theorem states that every impartial game under the normal play convention is equivalent to a one-heap

Vladimir Levenshtein (1,720 words) [view diff] exact match in snippet view article find links to article

26–42 V.I. Levenshtein, Elements of coding theory, In the book. Discrete mathematics and mathematical questions of cybernetics, Nauka, Moscow, 1974, 207–305

Mike Paterson (654 words) [view diff] case mismatch in snippet view article find links to article

British computer scientist, who was the director of the Centre for Discrete Mathematics and its Applications (DIMAP) at the University of Warwick until 2007

David P. Robbins (388 words) [view diff] exact match in snippet view article find links to article

three years to one or more researchers in algebra, combinatorics, or discrete mathematics. The first winner of the prize, in 2008, was Neil Sloane for the

Milliken's tree theorem (470 words) [view diff] no match in snippet view article find links to article

In mathematics, Milliken's tree theorem in combinatorics is a partition theorem generalizing Ramsey's theorem to infinite trees, objects with more structure

Karl Svozil (189 words) [view diff] case mismatch in snippet view article find links to article

Vienna Technical University. External Researcher at the Centre for Discrete Mathematics and Theoretical Computer Science of the University of Auckland. Research

Milliken–Taylor theorem (369 words) [view diff] no match in snippet view article find links to article

In mathematics, the Milliken–Taylor theorem in combinatorics is a generalization of both Ramsey's theorem and Hindman's theorem. It is named after Keith

Károly Bezdek (1,731 words) [view diff] case mismatch in snippet view article find links to article

is a founding Editor-in-Chief of the e-journal Contributions to Discrete Mathematics (CDM). Károly Bezdek was born in Budapest, Hungary, but grew up in

Chomsky–Schützenberger enumeration theorem (1,394 words) [view diff] no match in snippet view article find links to article

In formal language theory, the Chomsky–Schützenberger enumeration theorem is a theorem derived by Noam Chomsky and Marcel-Paul Schützenberger about the

Neil J. Calkin (527 words) [view diff] case mismatch in snippet view article find links to article

March 1961) is a professor at Clemson University in the Algebra and Discrete Mathematics group of the School of Mathematical and Statistical Sciences. His

Van der Waerden's theorem (3,636 words) [view diff] no match in snippet view article find links to article

Van der Waerden's theorem is a theorem in the branch of mathematics called Ramsey theory. Van der Waerden's theorem states that for any given positive

Kaplansky's game (192 words) [view diff] case mismatch in snippet view article find links to article

Beck, József (1982). "On a generalization of Kaplansky's game". Discrete Mathematics. 42 (1): 27–35. doi:10.1016/0012-365X(82)90050-4. Beck, József (2008)

Chomsky–Schützenberger representation theorem (442 words) [view diff] no match in snippet view article find links to article

In formal language theory, the Chomsky–Schützenberger representation theorem is a theorem derived by Noam Chomsky and Marcel-Paul Schützenberger about

List of things named after Pierre-Simon Laplace (420 words) [view diff] no match in snippet view article find links to article

This is a list of things named after Pierre-Simon Laplace de Moivre-Laplace theorem that approximates binomial distribution with a normal distribution

Gibbard's theorem (1,692 words) [view diff] no match in snippet view article find links to article

In the fields of mechanism design and social choice theory, Gibbard's theorem is a result proven by philosopher Allan Gibbard in 1973. It states that for

Threshold graph (803 words) [view diff] case mismatch in snippet view article find links to article

Šiňajová, Edita; Tůma, Miroslav (1985-04-01). "Threshold hypergraphs". Discrete Mathematics. 54 (2): 193–200. doi:10.1016/0012-365X(85)90080-9. ISSN 0012-365X

Laura Vargas Koch (365 words) [view diff] case mismatch in snippet view article find links to article

optimization as Bonn Junior Fellow in the Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics at the University of Bonn. Vargas

Katalin Vesztergombi (396 words) [view diff] case mismatch in snippet view article find links to article

László Lovász and József Pelikán, she is the author of the textbook Discrete Mathematics: Elementary and Beyond.[DM] Vesztergombi is married to László Lovász

Henry Cohn (460 words) [view diff] exact match in snippet view article find links to article

Fellow of the American Mathematical Society "for contributions to discrete mathematics, including applications to computer science and physics." In 2018

Michael Dinneen (235 words) [view diff] case mismatch in snippet view article find links to article

University of Auckland, New Zealand. He is co-director of the Center for Discrete Mathematics and Theoretical Computer Science. He does research in combinatorial

David P. Robbins Prize (478 words) [view diff] exact match in snippet view article find links to article

for papers reporting novel research in algebra, combinatorics, or discrete mathematics is awarded both by the American Mathematical Society (AMS) and by

Mikkel Thorup (564 words) [view diff] exact match in snippet view article find links to article

edge of the table. “The papers describe an impressive result in discrete mathematics; the problem is easily understood and the arguments, despite their

Nonomino (591 words) [view diff] case mismatch in snippet view article find links to article

Redelmeier, D. Hugh (1981). "Counting polyominoes: yet another attack". Discrete Mathematics. 36: 191–203. doi:10.1016/0012-365X(81)90237-5. Weisstein, Eric W

Jeannette Janssen (443 words) [view diff] case mismatch in snippet view article find links to article

Mathematics and Statistics, and the chair of the Activity Group on Discrete Mathematics of the Society for Industrial and Applied Mathematics. Janssen earned

E. Sampathkumar (313 words) [view diff] case mismatch in snippet view article find links to article

Retrieved 3 February 2010. "The Academy of Discrete Mathematics and Applications". The Academy of Discrete Mathematics and Applications. Retrieved 9 March 2018

Biregular graph (408 words) [view diff] case mismatch in snippet view article find links to article

H. (1997), Fractional graph theory, Wiley-Interscience Series in Discrete Mathematics and Optimization, New York: John Wiley & Sons Inc., p. 137, ISBN 0-471-17864-0

Biregular graph (408 words) [view diff] case mismatch in snippet view article find links to article

H. (1997), Fractional graph theory, Wiley-Interscience Series in Discrete Mathematics and Optimization, New York: John Wiley & Sons Inc., p. 137, ISBN 0-471-17864-0

Handshaking lemma (3,546 words) [view diff] case mismatch in snippet view article find links to article

201, ISBN 9780192880727 Biggs, Norman L. (2002), "15.3: Degree", Discrete Mathematics, Oxford University Press, pp. 181–182, ISBN 9780198507178 West, Douglas

Jacob Fox (430 words) [view diff] case mismatch in snippet view article find links to article

Society for Industrial and Applied Mathematics Activity Group on Discrete Mathematics. He was an invited speaker at the International Congress of Mathematicians

Herbert Fleischner (542 words) [view diff] case mismatch in snippet view article find links to article

the Institute for Information Processing, then at the Institute of Discrete Mathematics. He worked at the ÖAW until the end of 2002, but took leaves to work

Recursion (3,644 words) [view diff] case mismatch in snippet view article find links to article

doi:10.3115/1073083.1073104. Hunter, David (2011). Essentials of Discrete Mathematics. Jones and Bartlett. p. 494. ISBN 9781449604424. Shaffer, Eric. "CS

Martin Goldstern (509 words) [view diff] case mismatch in snippet view article find links to article

the TU Wien and head of the research unit 8 of the Institute of Discrete Mathematics and Geometry. His main research lies in set theory of the real line

Adjacent-vertex-distinguishing-total coloring (762 words) [view diff] case mismatch in snippet view article find links to article

"Concise proofs for adjacent vertex-distinguishing total colorings". Discrete Mathematics. 309 (8): 2548–2550. doi:10.1016/j.disc.2008.06.002. Chen, Xiang'en

Derek Corneil (1,089 words) [view diff] case mismatch in snippet view article find links to article

several publications such as Ars Combinatoria and SIAM Monographs on Discrete Mathematics and Applications. He was inducted as a Fields Institute Fellow in

Mihyun Kang (261 words) [view diff] case mismatch in snippet view article find links to article

properties of random graphs. She is a professor in the Institute of Discrete Mathematics at the Graz University of Technology. Kang completed a PhD at KAIST

Crossing Numbers of Graphs (469 words) [view diff] case mismatch in snippet view article find links to article

University, and published in 2018 by the CRC Press in their book series Discrete Mathematics and its Applications. The main text of the book has two parts, on

Ant on a rubber rope (2,536 words) [view diff] no match in snippet view article find links to article

The ant on a rubber rope is a mathematical puzzle with a solution that appears counterintuitive or paradoxical. It is sometimes given as a worm, or inchworm

Digital image processing (4,836 words) [view diff] exact match in snippet view article find links to article

development of mathematics (especially the creation and improvement of discrete mathematics theory); third, the demand for a wide range of applications in environment

Subset (1,631 words) [view diff] case mismatch in snippet view article find links to article

(2012). Discrete Mathematics and Its Applications (7th ed.). New York: McGraw-Hill. p. 119. ISBN 978-0-07-338309-5. Epp, Susanna S. (2011). Discrete Mathematics

Anne Penfold Street (956 words) [view diff] case mismatch in snippet view article find links to article

as professor in 1985. At Queensland, she directed the Centre for Discrete Mathematics and Computing from its formation in 1998 until 2004. She has also

Algorithmic Combinatorics on Partial Words (656 words) [view diff] case mismatch in snippet view article find links to article

Blanchet-Sadri, and published in 2008 by Chapman & Hall/CRC in their Discrete Mathematics and its Applications book series. A partial word is a string whose

Linear function (651 words) [view diff] case mismatch in snippet view article find links to article

Programming", in Leslie Hogben, ed., Handbook of Linear Algebra, Discrete Mathematics and Its Applications, Chapman and Hall/CRC, chap. 50. ISBN 1-584-88510-6

Ellingham–Horton graph (444 words) [view diff] case mismatch in snippet view article find links to article

MathWorld. Tutte, W. T. (1971), "On the 2-factors of bicubic graphs", Discrete Mathematics, 1 (2): 203–208, doi:10.1016/0012-365X(71)90027-6. Jessica Wolz,

Vineet Bafna (336 words) [view diff] case mismatch in snippet view article find links to article

Pavel Pevzner, and was a post-doctoral researcher at Center for Discrete Mathematics and Theoretical Computer Science. From 1999 to 2002, he worked at

Graham's number (3,300 words) [view diff] case mismatch in snippet view article find links to article

constant congruence speed of tetration". Notes on Number Theory and Discrete Mathematics. 26 (3): 245–260. doi:10.7546/nntdm.2020.26.3.245-260. Ripà, M. (November

Walk-regular graph (515 words) [view diff] exact match in snippet view article find links to article

In discrete mathematics, a walk-regular graph is a simple graph where the number of closed walks of any length from a vertex to itself does not depend

Gregory Gutin (248 words) [view diff] exact match in snippet view article find links to article

17 January 1957) is a scholar in theoretical computer science and discrete mathematics. He received his PhD in Mathematics in 1993 from Tel Aviv University

Arborescence (graph theory) (748 words) [view diff] case mismatch in snippet view article

& Sons. pp. 94–95. ISBN 978-1-84821-070-7. Jean Gallier (2011). Discrete Mathematics. Springer Science & Business Media. pp. 193–194. ISBN 978-1-4419-8046-5

Lajos Pósa (mathematician) (1,269 words) [view diff] case mismatch in snippet view article

1975, 585-595. L. Pósa: Hamiltonian circuits in random graphs, Discrete Mathematics, 14 (1976), 359-364. Pósa Lajos: Véletlen gráfok Hamilton körei,

Eight queens puzzle (3,616 words) [view diff] case mismatch in snippet view article find links to article

M. (1997), "Domination and irredundance in the queens' graph", Discrete Mathematics, 163 (1–3): 47–66, doi:10.1016/0012-365X(95)00327-S, hdl:1828/2670

George J. Minty (1,102 words) [view diff] exact match in snippet view article find links to article

American mathematician, specializing in mathematical analysis and discrete mathematics. He is known for the Klee–Minty cube, the Browder–Minty theorem,

Thomas Forster (mathematician) (271 words) [view diff] case mismatch in snippet view article

National de Recherches de Logique in Belgium, and the Centre for Discrete Mathematics and Theoretical Computer Science at the University of Auckland. Amongst

Jiří Matoušek (mathematician) (890 words) [view diff] case mismatch in snippet view article

Scholia has a profile for Jiří Matoušek (Q472657). Invitation to Discrete Mathematics (with Jaroslav Nešetřil). Oxford University Press, 1998. ISBN 978-0-19-850207-4

Balanced hypergraph (1,293 words) [view diff] case mismatch in snippet view article find links to article

Lovász, László; Plummer, M. D. (1986), Matching Theory, Annals of Discrete Mathematics, vol. 29, North-Holland, ISBN 0-444-87916-1, MR 0859549 Conforti

Affirming a disjunct (295 words) [view diff] case mismatch in snippet view article find links to article

Analysis with Proof, 5th edition. ISBN 978-0321747471. Rosen, Kenneth H. "Discrete Mathematics and its Applications: Kenneth H. Rosen". ISBN 978-1260091991.

List of aperiodic sets of tiles (2,491 words) [view diff] case mismatch in snippet view article find links to article

ISBN 978-981-02-3792-9 Kari, Jarkko (1996), "A small aperiodic set of Wang tiles", Discrete Mathematics, 160 (1–3): 259–264, doi:10.1016/0012-365X(95)00120-L Lagae, Ares

Ludwig Staiger (445 words) [view diff] case mismatch in snippet view article find links to article

Cantor Association and an external researcher of the Center for Discrete Mathematics and Theoretical Computer Science at the University of Auckland, New

Sarah-Marie Belcastro (1,044 words) [view diff] case mismatch in snippet view article find links to article

frequently at the University of Massachusetts, Amherst since 2012. Discrete Mathematics with Ducks (AK Peters, 2012; 2nd ed., CRC Press, 2019, ISBN 978-1-315-16767-1)

Carathéodory's theorem (convex hull) (2,153 words) [view diff] case mismatch in snippet view article

Lovász, László; Plummer, M. D. (1986). Matching Theory. Annals of Discrete Mathematics. Vol. 29. North-Holland. ISBN 0-444-87916-1. MR 0859549. Danzer,

369 (number) (109 words) [view diff] case mismatch in snippet view article

Redelmeier, D. Hugh (1981). "Counting polyominoes: yet another attack". Discrete Mathematics. 36 (2): 191–203. doi:10.1016/0012-365X(81)90237-5. Sequence A000105

Property B (1,111 words) [view diff] case mismatch in snippet view article find links to article

of Discrete Mathematics, vol. 29, North-Holland, ISBN 0-444-87916-1, MR 0859549 Beck, J. (1978), "On 3-chromatic hypergraphs", Discrete Mathematics, 24

Wolfram Mathematica (1,759 words) [view diff] exact match in snippet view article find links to article

Mathematica is the basis of the Combinatorica package, which adds discrete mathematics functionality in combinatorics and graph theory to the program. Communication

Ruchir Puri (360 words) [view diff] case mismatch in snippet view article find links to article

University, NY and was awarded John Von-Neumann Chair at Institute of Discrete Mathematics at Bonn University, Germany. Ruchir received the 2014 Asian American

Computer program (13,233 words) [view diff] case mismatch in snippet view article find links to article

(1991). Discrete Mathematics and Its Applications. McGraw-Hill, Inc. p. 616. ISBN 978-0-07-053744-6. Rosen, Kenneth H. (1991). Discrete Mathematics and Its

Yuri Zhuravlyov (mathematician) (394 words) [view diff] exact match in snippet view article

computer science was foundational for a number of specialties within discrete mathematics, pattern recognition, and predictive analysis. Zhuravlyov was a full

Chiral polytope (632 words) [view diff] case mismatch in snippet view article find links to article

(eds.), Applied Geometry and Discrete Mathematics (The Victor Klee Festschrift), DIMACS Series in Discrete Mathematics and Theoretical Computer Science

Archimedean Upper Conservatory (528 words) [view diff] case mismatch in snippet view article find links to article

guide the students’ minds through the ideas of Algebra, Geometry, Discrete Mathematics, Logic, and Physics as a complement to the standard Elementary Algebra/

Transylvania lottery (283 words) [view diff] exact match in snippet view article find links to article

Salvador (2008), "Algebraic topics on discrete mathematics", in Moore, Kenneth B. (ed.), Discrete mathematics research progress, Hauppauge, NY: Nova

Symmetric relation (383 words) [view diff] case mismatch in snippet view article find links to article

transitivity. The proof of xRy ⇒ yRy is similar. Biggs, Norman L. (2002). Discrete Mathematics. Oxford University Press. p. 57. ISBN 978-0-19-871369-2. "MAD3105

Michael Drmota (310 words) [view diff] case mismatch in snippet view article find links to article

habilitation in 1990 and is now full professor at the Institute of Discrete Mathematics and Geometry, where he also served as head of institute from 2004

Martin Aigner (517 words) [view diff] exact match in snippet view article find links to article

in Enumeration, 2007, ISBN 3-540-39032-4 Aigner, Martin (2007). Discrete mathematics. Providence, R.I.: American Mathematical Society. ISBN 978-0-8218-4151-8

Radius (1,188 words) [view diff] case mismatch in snippet view article find links to article

Andrew M. Gleason (ed.). Advanced Mathematics: Precalculus with Discrete Mathematics and Data Analysis. Evanston, Illinois: McDougal Littell. ISBN 0-395-77114-5

Rational number (3,494 words) [view diff] case mismatch in snippet view article find links to article

Rational Trigonometry to Universal Geometry Rosen, Kenneth (2007). Discrete Mathematics and its Applications (6th ed.). New York, NY: McGraw-Hill. pp. 105

Fred S. Roberts (505 words) [view diff] case mismatch in snippet view article find links to article

center concept". In 2003, DIMACS held a Conference on Applications of Discrete Mathematics and Theoretical Computer Science, in honor of Roberts' 60th birthday

Algorithms and Combinatorics (532 words) [view diff] case mismatch in snippet view article find links to article

Monique Laurent, 1997, vol. 15) Probabilistic Methods for Algorithmic Discrete Mathematics (M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, 1998,

Tree (graph theory) (3,282 words) [view diff] case mismatch in snippet view article

Media. pp. 167–168. ISBN 978-1-4471-2499-3. Kenneth Rosen (2011). Discrete Mathematics and Its Applications, 7th edition. McGraw-Hill Science. p. 747.

Jaroslav Nešetřil (728 words) [view diff] exact match in snippet view article find links to article

and for his leading role in establishing a world-renowned group in discrete mathematics at Charles University”. Scholia has a profile for Jaroslav Nešetřil

Robbins' theorem (1,040 words) [view diff] case mismatch in snippet view article find links to article

V. K. (1996), "4.6 Strong Orientation of Graphs", Introductory Discrete Mathematics, Mineola, NY: Dover Publications Inc., p. 135, ISBN 978-0-486-69115-2

Rostislav Grigorchuk (2,030 words) [view diff] case mismatch in snippet view article find links to article

"Geometriae Dedicata", "Ukrainian Mathematical Journal", "Algebra and Discrete Mathematics", "Carpathian Mathematical Publications", "Bukovinian Mathematical

Vera Pless (810 words) [view diff] case mismatch in snippet view article find links to article

the Theory of Error-Correcting Codes. Wiley-Interscience Series in Discrete Mathematics. John Wiley & Sons. ISBN 0-471-08684-3. 2nd ed., 1989; 3rd ed., 1998

Concrete Mathematics (470 words) [view diff] case mismatch in snippet view article find links to article

the topics in Concrete Mathematics are "a blend of CONtinuous and disCRETE mathematics". Calculus is frequently used in the explanations and exercises.

Concrete Mathematics (470 words) [view diff] case mismatch in snippet view article find links to article

the topics in Concrete Mathematics are "a blend of CONtinuous and disCRETE mathematics". Calculus is frequently used in the explanations and exercises.

Vera Pless (810 words) [view diff] case mismatch in snippet view article find links to article

the Theory of Error-Correcting Codes. Wiley-Interscience Series in Discrete Mathematics. John Wiley & Sons. ISBN 0-471-08684-3. 2nd ed., 1989; 3rd ed., 1998

PH (complexity) (416 words) [view diff] case mismatch in snippet view article

Kenneth H. (ed.). Handbook of Discrete and Combinatorial Mathematics. Discrete Mathematics and Its Applications (2nd ed.). CRC Press. pp. 1308–1314. ISBN 9781351644051

Nathaniel Dean (mathematician) (1,046 words) [view diff] case mismatch in snippet view article

Joseph; Franzblau, Deborah; Roberts, Fred (1997). Discrete Mathematics in the Schools. Discrete Mathematics and Theoretical Computer Science. Vol. 36 (1 ed

SGP (194 words) [view diff] exact match in snippet view article find links to article

model, for orbital calculations Social Golfer Problem, a problem in discrete mathematics Shay Gap Airport, IATA airport code "SGP" Schweizer SGP 1-1, an American

109 (number) (401 words) [view diff] case mismatch in snippet view article

(January 2015). "Uniform edge-c-colorings of the Archimedean tilings". Discrete Mathematics. 338 (1): 19–22. doi:10.1016/j.disc.2014.08.015. Zbl 1308.52017.

Steiner tree problem (4,365 words) [view diff] case mismatch in snippet view article find links to article

Jaroslav (2001), "Vojtěch Jarnik's work in combinatorial optimization", Discrete Mathematics, 235 (1–3): 1–17, doi:10.1016/S0012-365X(00)00256-9, hdl:10338.dmlcz/500662

MU puzzle (1,458 words) [view diff] case mismatch in snippet view article find links to article

key idea behind Godel's Incompleteness Theorem. In her textbook, Discrete Mathematics with Applications, Susanna S. Epp uses the MU puzzle to introduce

Catalan number (5,473 words) [view diff] case mismatch in snippet view article find links to article

"Catalan-like number sequences and Hausdorff moment sequences", Discrete Mathematics, 343 (5): 111808, 11, arXiv:1809.07523, doi:10.1016/j.disc.2019.111808

Partially ordered set (5,390 words) [view diff] case mismatch in snippet view article find links to article

203: DISCRETE MATHEMATICS. Retrieved 23 July 2021. Kwong, Harris (25 April 2018). "7.4: Partial and Total Ordering". A Spiral Workbook for Discrete Mathematics

Graham–Pollak theorem (1,395 words) [view diff] case mismatch in snippet view article find links to article

G. W. (1984), "A new proof of a theorem of Graham and Pollak", Discrete Mathematics, 49 (3): 327–328, doi:10.1016/0012-365X(84)90174-2, MR 0743808 Cioabă

Addition principle (767 words) [view diff] case mismatch in snippet view article find links to article

University Press. p. 66. ISBN 978-962-209-181-8. Penner, R. C. (1999). Discrete Mathematics: Proof Techniques and Mathematical Structures. World Scientific.

Z notation (931 words) [view diff] case mismatch in snippet view article find links to article

Press. ISBN 0-521-55976-6. Ince, D C (1993). An Introduction to Discrete Mathematics, Formal System Specification, and Z. Oxford University Press. ISBN 9780198538370

József Beck (606 words) [view diff] case mismatch in snippet view article find links to article

114, Cambridge University Press, 2008) Inevitable Randomness in Discrete Mathematics (University Lecture Series 49, American Mathematical Society, 2009)

Circular-arc graph (866 words) [view diff] case mismatch in snippet view article find links to article

polynomials, chromatic quasisymmetric functions and graphs with cycles". Discrete Mathematics. 341 (12): 3453–3482. arXiv:1705.10353. doi:10.1016/j.disc.2018.09

Dénes Kőnig (796 words) [view diff] exact match in snippet view article find links to article

Mathematics Activity Group on Discrete Mathematics to an early career researcher for outstanding research in an area of discrete mathematics. The first award was

Empirical algorithmics (1,220 words) [view diff] case mismatch in snippet view article find links to article

Algorithmics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Vol. 59. DIMACS Series in Discrete Mathematics and Theoretical Computer

Yuri Matiyasevich (1,054 words) [view diff] case mismatch in snippet view article find links to article

Symbolic Logic; and also of the editorial boards for the journals Discrete Mathematics and Applications and Computer Instruments in Education. As a teacher

Béla Andrásfai (480 words) [view diff] case mismatch in snippet view article find links to article

Mathematical Sciences. Designer and subject lecturer of the course Discrete Mathematics. At the invitation of the Mathematical Institute of the Eötvös Loránd

Gabriel Andrew Dirac (474 words) [view diff] case mismatch in snippet view article find links to article

Archive, University of St Andrews Gabriel Andrew Dirac. Annals of Discrete Mathematics. Vol. 41. Elsevier. 1988. pp. 1–6. doi:10.1016/S0167-5060(08)70444-8

Rigidity matroid (2,211 words) [view diff] case mismatch in snippet view article find links to article

generic global rigidity", Applied Geometry and Discrete Mathematics, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 4, Providence

2-factor theorem (426 words) [view diff] case mismatch in snippet view article find links to article

Mulder, H. (1992), "Julius Petersen's theory of regular graphs", Discrete Mathematics, 100: 157–175, doi:10.1016/0012-365X(92)90639-W. Lützen, J.; Sabidussi

Jo Ellis-Monaghan (314 words) [view diff] case mismatch in snippet view article find links to article

positions at the University of Vermont. In 2020 she became professor of Discrete Mathematics at the University of Amsterdam. With Iain Moffat, Ellis-Monaghan

Semiorder (2,275 words) [view diff] case mismatch in snippet view article find links to article

Falmagne, Jean-Claude (1997), "Well-graded families of relations", Discrete Mathematics, 173 (1–3): 35–44, doi:10.1016/S0012-365X(96)00095-7, MR 1468838

Vera Traub (360 words) [view diff] case mismatch in snippet view article find links to article

Steiner tree problem. She is a junior professor in the Institute for Discrete Mathematics at the University of Bonn. Traub earned a bachelor's degree at the

Closure problem (1,622 words) [view diff] case mismatch in snippet view article find links to article

closure in a digraph", Combinatorial Optimization, Wiley Series in Discrete Mathematics and Optimization, vol. 33, John Wiley & Sons, pp. 49–50, ISBN 9781118031391

List of Greek mathematicians (1,049 words) [view diff] case mismatch in snippet view article find links to article

Peter Gritzmann; Bernd Sturmfels; Victor Klee. Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift. American Mathematical Soc. p. 415.

Wheel graph (580 words) [view diff] case mismatch in snippet view article find links to article

Weisstein, Eric W. "Wheel Graph". MathWorld. Rosen, Kenneth H. (2011). Discrete Mathematics and Its Applications (7th ed.). McGraw-Hill. p. 655. ISBN 978-0073383095

Ahlswede–Khachatrian theorem (1,988 words) [view diff] no match in snippet view article find links to article

In extremal set theory, the Ahlswede–Khachatrian theorem generalizes the Erdős–Ko–Rado theorem to t-intersecting families. Given parameters n, k and t

List of Greek mathematicians (1,049 words) [view diff] case mismatch in snippet view article find links to article

Peter Gritzmann; Bernd Sturmfels; Victor Klee. Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift. American Mathematical Soc. p. 415.

Davenport–Schinzel sequence (1,626 words) [view diff] case mismatch in snippet view article find links to article

Davenport–Schinzel sequences", Contemporary Trends in Discrete Mathematics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49, American

Laura Person (266 words) [view diff] case mismatch in snippet view article find links to article

co-author of the textbook Write Your Own Proofs In Set Theory and Discrete Mathematics (Zinka Press, 2005). The book's other co-author, Amy Babich, is a

(a, b)-decomposition (810 words) [view diff] case mismatch in snippet view article

(2009). "Planar graphs decomposable into a forest and a matching". Discrete Mathematics. 309 (1): 277–279. doi:10.1016/j.disc.2007.12.104. Bassa, A.; Burns

Floyd–Warshall algorithm (2,971 words) [view diff] case mismatch in snippet view article find links to article

problems in directed graphs", pp. 570–576. Kenneth H. Rosen (2003). Discrete Mathematics and Its Applications, 5th Edition. Addison Wesley. ISBN 978-0-07-119881-3

Complete bipartite graph (959 words) [view diff] case mismatch in snippet view article find links to article

; Toft, Bjarne (2011), Graph Coloring Problems, Wiley Series in Discrete Mathematics and Optimization, vol. 39, Wiley, p. 16, ISBN 9781118030745. Bandelt

Domino (mathematics) (370 words) [view diff] case mismatch in snippet view article

Redelmeier, D. Hugh (1981). "Counting polyominoes: yet another attack". Discrete Mathematics. 36 (2): 191–203. doi:10.1016/0012-365X(81)90237-5. Berger, Robert

Disjoint sets (1,280 words) [view diff] case mismatch in snippet view article find links to article

1137/0216062, MR 0917035, S2CID 33265037. Ferland, Kevin (2008), Discrete Mathematics: An Introduction to Proofs and Combinatorics, Cengage Learning, p

Electronic Journal of Combinatorics (470 words) [view diff] exact match in snippet view article find links to article

The Electronic Journal of Combinatorics Discipline Discrete mathematics Language English Publication details Open access Free to authors and readers Standard

De Bruijn torus (587 words) [view diff] case mismatch in snippet view article find links to article

Graham, R. (1992). "Universal cycles for combinatorial structures". Discrete Mathematics. 110 (1): 43–59. doi:10.1016/0012-365x(92)90699-g. Jackson, Brad;

Graph enumeration (441 words) [view diff] case mismatch in snippet view article find links to article

Frank; Schwenk, Allen J. (1973), "The number of caterpillars" (PDF), Discrete Mathematics, 6 (4): 359–365, doi:10.1016/0012-365x(73)90067-8, hdl:2027.42/33977

Decomino (389 words) [view diff] case mismatch in snippet view article find links to article

Redelmeier, D. Hugh (1981). "Counting polyominoes: yet another attack". Discrete Mathematics. 36 (2): 191–203. doi:10.1016/0012-365X(81)90237-5. Iread.it: Maximal

Set (mathematics) (4,659 words) [view diff] case mismatch in snippet view article

Seymor Lipschutz; Marc Lipson (22 June 1997). Schaum's Outline of Discrete Mathematics. McGraw Hill Professional. p. 1. ISBN 978-0-07-136841-4. "Introduction

Box-making game (565 words) [view diff] case mismatch in snippet view article find links to article

Chvátal, V.; Erdös, P. (1978). "Biased Positional Games". Annals of Discrete Mathematics. 2 (C): 221–229. doi:10.1016/S0167-5060(08)70335-2. ISSN 0167-5060

Binary tree (5,125 words) [view diff] case mismatch in snippet view article find links to article

the tree Unrooted binary tree Rowan Garnier; John Taylor (2009). Discrete Mathematics:Proofs, Structures and Applications, Third Edition. CRC Press. p

Octomino (617 words) [view diff] case mismatch in snippet view article find links to article

Redelmeier, D. Hugh (1981). "Counting polyominoes: yet another attack". Discrete Mathematics. 36 (2): 191–203. doi:10.1016/0012-365X(81)90237-5. Rhoads, Glenn

Baruch Schieber (835 words) [view diff] case mismatch in snippet view article find links to article

2003. He was also a member of the executive board at the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) until 2018, and continues

Pappus configuration (580 words) [view diff] case mismatch in snippet view article find links to article

J.; Mathon, R. A. (eds.), Combinatorial Design Theory, Annals of Discrete Mathematics, vol. 34, Elsevier, pp. 371–378, doi:10.1016/S0304-0208(08)72903-7

Svante Janson (1,138 words) [view diff] case mismatch in snippet view article find links to article

Rucinski, Andrzej (2000). Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. New York: Wiley-Interscience. pp. xii+333. ISBN 0-471-17541-2

Total relation (608 words) [view diff] case mismatch in snippet view article find links to article

Gunther; Ströhlein, Thomas (6 December 2012). Relations and Graphs: Discrete Mathematics for Computer Scientists. Springer Science & Business Media. ISBN 978-3-642-77968-8

Collaboration graph (1,052 words) [view diff] exact match in snippet view article find links to article

the notion of a "rational Erdős number". Graph theory – Area of discrete mathematics Odda, Tom (1979). "On properties of a well-known graph or what is

Matroid representation (1,768 words) [view diff] case mismatch in snippet view article find links to article

"Infinite antichains of matroids with characteristic set {p}", Discrete Mathematics, 242 (1–3): 175–185, doi:10.1016/S0012-365X(00)00466-0, hdl:10092/13245

Cycle double cover (1,663 words) [view diff] case mismatch in snippet view article find links to article

(1985), "A survey of the cycle double cover conjecture", Annals of Discrete Mathematics 27 – Cycles in Graphs, North-Holland Mathematics Studies, vol. 27

Hasse's theorem on elliptic curves (574 words) [view diff] case mismatch in snippet view article find links to article

(2008), Elliptic Curves. Number Theory and Cryptography, 2nd Ed, Discrete Mathematics and its Applications, Boca Raton: Chapman & Hall/CRC Press, ISBN 978-1-4200-7146-7

Modular arithmetic (3,902 words) [view diff] case mismatch in snippet view article find links to article

Mathematics LibreTexts. 2013-11-16. Retrieved 2020-08-12. Sengadir T., Discrete Mathematics and Combinatorics, p. 293, at Google Books "Euler's sum of powers

Levi graph (598 words) [view diff] case mismatch in snippet view article find links to article

; Dinitz, Jeffrey H. (eds.), Handbook of combinatorial designs, Discrete Mathematics and its Applications (Boca Raton) (Second ed.), Chapman & Hall/CRC

Martin Dyer (392 words) [view diff] case mismatch in snippet view article find links to article

problems In 1991, Professor Dyer received the Fulkerson Prize in Discrete Mathematics (Jointly with Alan Frieze and Ravi Kannan for the paper "A random

Donald Knuth (5,733 words) [view diff] case mismatch in snippet view article find links to article

, ISBN 1-57586-382-0 (paperback) ——— (2003). Selected Papers on Discrete Mathematics. Lecture Notes. Stanford, CA: Center for the Study of Language and

Scheinerman's conjecture (762 words) [view diff] case mismatch in snippet view article find links to article

-A.; Newman, I.; Ziv, R. (1991), "On grid intersection graphs", Discrete Mathematics, 87 (1): 41–52, doi:10.1016/0012-365X(91)90069-E, MR 1090188. Scheinerman

Characteristic (algebra) (1,266 words) [view diff] case mismatch in snippet view article

Springer. p. A.V.7. doi:10.1007/978-3-642-61698-3. The Wikibook Discrete Mathematics has a page on the topic of: Finite fields McCoy, Neal H. (1973) [1964]

Alternating sign matrix (805 words) [view diff] case mismatch in snippet view article find links to article

340–359. Propp, James, The many faces of alternating-sign matrices, Discrete Mathematics and Theoretical Computer Science, Special issue on Discrete Models:

Heptomino (669 words) [view diff] case mismatch in snippet view article find links to article

Redelmeier, D. Hugh (1981). "Counting polyominoes: yet another attack". Discrete Mathematics. 36 (2): 191–203. doi:10.1016/0012-365X(81)90237-5. Rhoads, Glenn

Terminal and nonterminal symbols (907 words) [view diff] exact match in snippet view article find links to article

negative zero strings like "-0" and "-00000". Rosen, K. H. (2012). Discrete mathematics and its applications. McGraw-Hill. pages 847-851 Chomsky, Noam (1956)

Antisymmetric relation (589 words) [view diff] case mismatch in snippet view article find links to article

Lipschutz, Seymour; Marc Lars Lipson (1997). Theory and Problems of Discrete Mathematics. McGraw-Hill. p. 33. ISBN 0-07-038045-7. nLab antisymmetric relation

Square lattice (551 words) [view diff] case mismatch in snippet view article find links to article

Joseph (eds.), Handbook of Discrete and Computational Geometry, Discrete Mathematics and Its Applications (2nd ed.), CRC Press, pp. 53–72, ISBN 9781420035315

Star (graph theory) (691 words) [view diff] case mismatch in snippet view article

Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3, MR 1432221

Computational group theory (293 words) [view diff] case mismatch in snippet view article find links to article

Eick, Eamonn A. O'Brien, "Handbook of computational group theory", Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall/CRC, Boca Raton

Quotient (825 words) [view diff] exact match in snippet view article find links to article

Weisstein, Eric W. "Quotient". MathWorld. Epp, Susanna S. (2011-01-01). Discrete mathematics with applications. Brooks/Cole. p. 163. ISBN 9780495391326. OCLC 970542319

Dan Romik (744 words) [view diff] exact match in snippet view article find links to article

Davis. He is known for contributions to probability theory and discrete mathematics. Romik received his Ph.D. from Tel Aviv University in 2002 under

Hexomino (778 words) [view diff] case mismatch in snippet view article find links to article

Redelmeier, D. Hugh (1981). "Counting polyominoes: yet another attack". Discrete Mathematics. 36: 191–203. doi:10.1016/0012-365X(81)90237-5. Rhoads, Glenn C.

Homogeneity and heterogeneity (1,278 words) [view diff] case mismatch in snippet view article find links to article

Schmidt, Gunther; Ströhlein, Thomas (2012). Relations and Graphs: Discrete Mathematics for Computer Scientists. Springer Science & Business Media. ISBN 978-3-642-77968-8

Apéry's constant (2,804 words) [view diff] case mismatch in snippet view article find links to article

accelerated series for some classical constants by the Markov-WZ method", Discrete Mathematics & Theoretical Computer Science, 7: 11–24, doi:10.46298/dmtcs.342

Debra Boutin (743 words) [view diff] case mismatch in snippet view article find links to article

and Applied Mathematics; she was elected Secretary of the latter's Discrete Mathematics Activity Group. In 2008 Boutin was the inaugural recipient of the

List of mathematics awards (162 words) [view diff] exact match in snippet view article find links to article

Association of America Novel research in algebra, combinatorics, or discrete mathematics United States Deborah and Franklin Haimo Awards Mathematical Association

Triangular prism (1,515 words) [view diff] case mismatch in snippet view article find links to article

Euler's Formula". In Hopkin, Brian (ed.). Resources for Teaching Discrete Mathematics: Classroom Projects, History Modules, and Articles. Mathematical