Mathematics Subject Classification 2000
05-00 General reference works (handbooks, dictionaries, bibliographies, etc.) ( 1 Dok.)
- 05-01 Instructional exposition (textbooks, tutorial papers, etc.) ( 0 Dok.)
- 05-02 Research exposition (monographs, survey articles) ( 0 Dok.)
- 05-03 Historical (must also be assigned at least one classification number from Section 01) ( 0 Dok.)
- 05-04 Explicit machine computation and programs (not the theory of computation or programming) ( 0 Dok.)
- 05-06 Proceedings, conferences, collections, etc. ( 0 Dok.)
- 05-XX Combinatorics ( 0 Dok.)
- 05A05 Combinatorial choice problems (subsets, representatives, permutations) ( 0 Dok.)
- 05A10 Factorials, binomial coefficients, combinatorial functions ( 0 Dok.)
- 05A15 Exact enumeration problems, generating functions Asymptotic enumeration ( 0 Dok.)
- 05A17 Partitions of integers ( 0 Dok.)
- 05A18 Partitions of sets ( 0 Dok.)
- 05A19 Combinatorial identities ( 0 Dok.)
- 05A20 Combinatorial inequalities ( 0 Dok.)
- 05A30 q-calculus and related topics ( 0 Dok.)
- 05A40 Umbral calculus ( 0 Dok.)
- 05A99 None of the above, but in this section ( 0 Dok.)
- 05Axx Enumerative combinatorics ( 0 Dok. )
- 05B05 Block designs ( 0 Dok.)
- 05B07 Triple systems ( 0 Dok.)
- 05B10 Difference sets (number-theoretic, group-theoretic, etc.) ( 0 Dok.)
- 05B15 Orthogonal arrays, Latin squares, Room squares ( 0 Dok.)
- 05B20 Matrices (incidence, Hadamard, etc.) ( 0 Dok.)
- 05B25 Finite geometries ( 0 Dok.)
- 05B30 Other designs, configurations ( 0 Dok.)
- 05B35 Matroids, geometric lattices ( 0 Dok.)
- 05B40 Packing and covering ( 0 Dok.)
- 05B45 Tessellation and tiling problems ( 0 Dok.)
- 05B50 Polyominoes ( 0 Dok.)
- 05B99 None of the above, but in this section ( 0 Dok.)
- 05Bxx Designs and configurations ( 0 Dok. )
- 05C05 Trees ( 0 Dok.)
- 05C07 Degree sequences ( 0 Dok.)
- 05C10 Topological graph theory, imbedding ( 0 Dok.)
- 05C12 Distance in graphs ( 0 Dok.)
- 05C15 Coloring of graphs and hypergraphs ( 0 Dok.)
- 05C17 Perfect graphs ( 0 Dok.)
- 05C20 Directed graphs (digraphs), tournaments ( 0 Dok.)
- 05C22 Signed, gain and biased graphs ( 0 Dok.)
- 05C25 Graphs and groups ( 0 Dok.)
- 05C30 Enumeration of graphs and maps ( 0 Dok.)
- 05C35 Extremal problems ( 0 Dok.)
- 05C38 Paths and cycles ( 0 Dok.)
- 05C40 Connectivity ( 0 Dok.)
- 05C45 Eulerian and Hamiltonian graphs ( 0 Dok.)
- 05C50 Graphs and matrices ( 0 Dok.)
- 05C55 Generalized Ramsey theory ( 0 Dok.)
- 05C60 Isomorphism problems (reconstruction conjecture, etc.) ( 0 Dok.)
- 05C62 Graph representations (geometric and intersection representations, etc.) ( 0 Dok.)
- 05C65 Hypergraphs ( 0 Dok.)
- 05C69 Dominating sets, independent sets, cliques ( 0 Dok.)
- 05C70 Factorization, matching, covering and packing ( 0 Dok.)
- 05C75 Structural characterization of types of graphs ( 0 Dok.)
- 05C78 Graph labelling (graceful graphs, bandwidth, etc.) ( 0 Dok.)
- 05C80 Random graphs ( 0 Dok.)
- 05C83 Graph minors ( 0 Dok.)
- 05C85 Graph algorithms ( 0 Dok.)
- 05C90 Applications ( 0 Dok.)
- 05C99 None of the above, but in this section ( 0 Dok.)
- 05Cxx Graph theory ( 0 Dok. )
- 05D05 Extremal set theory ( 0 Dok.)
- 05D10 Ramsey theory ( 0 Dok.)
- 05D15 Transversal (matching) theory ( 0 Dok.)
- 05D40 Probabilistic methods ( 0 Dok.)
- 05D99 None of the above, but in this section ( 0 Dok.)
- 05Dxx Extremal combinatorics ( 0 Dok. )
- 05E05 Symmetric functions ( 0 Dok.)
- 05E10 Tableaux, representations of the symmetric group ( 1 Dok.)
- 05E15 Combinatorial problems concerning the classical groups ( 0 Dok.)
- 05E20 Group actions on designs, geometries and codes ( 0 Dok.)
- 05E25 Group actions on posets and homology groups of posets ( 0 Dok.)
- 05E30 Association schemes, strongly regular graphs ( 0 Dok.)
- 05E35 Orthogonal polynomials ( 0 Dok.)
- 05E99 None of the above, but in this section ( 0 Dok.)
- 05Exx Algebraic combinatorics ( 1 Dok. )
Home |
Suchen |
Veröffentlichen
Sie benötigen weitere Informationen?
Fragen Sie uns!
Letzte Änderung:
14.07.10 |