Discrete mathematics

DOI10.1007/978-1-4419-8047-2zbMath1227.05002OpenAlexW4250298599MaRDI QIDQ621893

Jean H. Gallier

Publication date: 31 January 2011

Published in: Universitext (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4419-8047-2

zbMATH Keywords

permutationsRSAgraph theorymatchingslatticesmultinomial coefficientspartial ordersclassical logicprime factorizationCounting Problemsdirected and undirected graphsfunctions and relationsincidence and adjacency matrixPrinciple of Inclusion-Exclusionproof principles

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) General logic (03Bxx) Graph theory (05Cxx) Enumerative combinatorics (05Axx) Logic (educational aspects) (97E30) Ordered sets (06Axx) Comprehensive works on combinatorics, graph theory, and probability (educational aspects) (97K10) Distributive lattices (06Dxx)

Related Items (7)

Formulations of the inclusion–exclusion principle from Legendre to Poincaré, with emphasis on Daniel Augusto da Silva ⋮ Exact and parameterized algorithms for read-once refutations in Horn constraint systems ⋮ Groups, Graphs, and Hypergraphs: Average Sizes of Kernels of Generic Matrices with Support Constraints ⋮ Weighted join operators on directed trees ⋮ Expansivity and cone-fields in metric spaces ⋮ The Mathematics of Superoscillations ⋮ Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space

This page was built for publication: Discrete mathematics