Discrete mathematics离散数学

Geodesic 001 Cycle graph 002 Maximum degree 003 Chromatic index 004 Rectifiable varifold 005 IEEE 754 006 Multiset containment 007 Neighborhood multiset 008 Multigraph adjacency 009 Face adjacency graph 010 Face complexity 011 Reachability 012 Negative cycle 013 State graph 014 Tree 015 Graph 016 Sparse matrix 017 Adjacency matrix 018 Factor poset 019 Disjoint sets 020 Planar Arrangement 021 Monotone polygonal chain 022 Polygonal chain 023 Interval overlap 024 Set-valued map 025 Perfect matching 026 Complete bipartite graph 027 Edge density 028 Mantel’s theorem 029 Induced subgraph avoidance 030 Extremal graph theory 031 Maximum clique 032 Tie-breaking rule 033 Corner adjacency 034 Diagonal adjacency 035 Option type 036 Optimal string alignment 037 Damerau–Levenshtein distance 038 Edit distance 039 Countable set 040 Ordered set 041 Discrete topology 042 Discrete metric 043 Nets 044 Orthonormal set 045 Diagram equivalence 046 Degree shift 047 Reachable subspace 048 Synchronizing transformation 049 Arbitrary union 050