Biblioteca Dr. Antonio Monteiro · Catálogo | |
05 | Combinatorics | ||
05-00 | General reference works (handbooks, dictionaries, bibliographies, etc.) | ||
05-01 | Instructional exposition (textbooks, tutorial papers, etc.) | ||
05-02 | Research exposition (monographs, survey articles) | ||
05-03 | Historical | ||
05-04 | Explicit machine computation and programs (not the theory of computation or programming) | ||
05-06 | Proceedings, conferences, collections, etc. | ||
05-99 | Combinatorics (not classified at a more specific level) | ||
05A | Enumerative combinatorics | ||
05A05 | Combinatorial choice problems (subsets, representatives, permutations) | ||
05A10 | Factorials, binomial coefficients, combinatorial functions [See also 11B65, 33Cxx] | ||
05A15 | Exact enumeration problems, generating functions [See also 33Cxx, 33Dxx] | ||
05A16 | Asymptotic enumeration | ||
05A17 | Partitions of integers [See also 11P81, 11P82, 11P83] | ||
05A18 | Partitions of sets | ||
05A19 | Combinatorial identities | ||
05A20 | Combinatorial inequalities | ||
05A30 | $q$-calculus and related topics [See also 03Dxx] | ||
05A40 | Umbral calculus | ||
05A99 | None of the above, but in this section | ||
05B | Designs and configurations {For applications of design theory, see 94C30} | ||
05B05 | Block designs [See also 51E05, 62K10] | ||
05B07 | Triple systems | ||
05B10 | Difference sets (number-theoretic, group-theoretic, etc.) [See also 11B13] | ||
05B15 | Orthogonal arrays, Latin squares, Room squares | ||
05B20 | Matrices (incidence, Hadamard, etc.) | ||
05B25 | Finite geometries [See also 51D20, 51Exx] | ||
05B30 | Other designs, configurations [See also 51E30] | ||
05B35 | Matroids, geometric lattices [See also 52B40, 90C27] | ||
05B40 | Packing and covering [See also 11H31, 52C15, 52C17] | ||
05B45 | Tessellation and tiling problems [See also 52C20, 52C22] | ||
05B50 | Polyominoes | ||
05B99 | None of the above, but in this section | ||
05C | Graph theory {For applications of graphs, see 68R10, 90C35, 94C15} | ||
05C05 | Trees | ||
05C07 | Degree sequences | ||
05C10 | Topological graph theory, imbedding [See also 57M15, 57M25] | ||
05C12 | Distance in graphs | ||
05C15 | Coloring of graphs and hypergraphs | ||
05C17 | Perfect graphs | ||
05C20 | Directed graphs (digraphs), tournaments | ||
05C22 | Signed, gain and biased graphs | ||
05C25 | Graphs and groups [See also 20F65] | ||
05C30 | Enumeration of graphs and maps | ||
05C35 | Extremal problems [See also 90C35] | ||
05C38 | Paths and cycles [See also 90B10] | ||
05C40 | Connectivity | ||
05C45 | Eulerian and Hamiltonian graphs | ||
05C50 | Graphs and matrices | ||
05C55 | Generalized Ramsey theory | ||
05C60 | Isomorphism problems (reconstruction conjecture, etc.) | ||
05C62 | Graph representations (geometric and intersection representations, etc.) | ||
05C65 | Hypergraphs | ||
05C69 | Dominating sets, independent sets, cliques | ||
05C70 | Factorization, matching, covering and packing | ||
05C75 | Structural characterization of types of graphs | ||
05C78 | Graph labelling (graceful graphs, bandwidth, etc.) | ||
05C80 | Random graphs | ||
05C83 | Graph minors | ||
05C85 | Graph algorithms [See also 68R10, 68W05] | ||
05C90 | Applications | ||
05C99 | None of the above, but in this section | ||
05D | Extremal combinatorics | ||
05D05 | Extremal set theory | ||
05D10 | Ramsey theory | ||
05D15 | Transversal (matching) theory | ||
05D40 | Probabilistic methods | ||
05D99 | None of the above, but in this section | ||
05E | Algebraic combinatorics | ||
05E05 | Symmetric functions | ||
05E10 | Tableaux, representations of the symmetric group [See also 20C30] | ||
05E15 | Combinatorial problems concerning the classical groups [See also 22E45, 33C80] | ||
05E20 | Group actions on designs, geometries and codes | ||
05E25 | Group actions on posets and homology groups of posets [See also 06A11] | ||
05E30 | Association schemes, strongly regular graphs | ||
05E35 | Orthogonal polynomials [See also 33C45, 33C50, 33D45] | ||
05E99 | None of the above, but in this section |
Si necesita ayuda para encontrar información, puede visitar personalmente la biblioteca, llamarnos por teléfono al 291 459 5116, o enviarnos un mensaje a bibima@criba.edu.ar.
Para solicitar copias de artículos, complete el formulario o escríbanos a pedidos.inmabb@gmail.com