Discrete Mathematics
DOI10.1007/b97469zbMath1059.00001OpenAlexW4248832625MaRDI QIDQ4789147
László Lovász, József Pelikán, Katalin Vesztergombi
Publication date: 27 January 2003
Published in: Undergraduate Texts in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b97469
combinatoricsgraph theoryFibonacci numbersLatin squareEuclidean algorithmbinomial coefficientsnumber theoryPascal trianglecombinatorial probabilityinclusion-exclusion principleFermat theoremcoloring mapspigeonholes principle
Trees (05C05) Factorials, binomial coefficients, combinatorial functions (05A10) Permutations, words, matrices (05A05) Mathematics in general (00A05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Eulerian and Hamiltonian graphs (05C45) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to geometry (51-01)
Related Items (15)
This page was built for publication: Discrete Mathematics