Questions related to combinatorics and discrete mathematical structures
Combinatorics deals with discrete mathematical structures. The structures can be either finite or countable. Some subfields are
- (Enumerative combinatorics) counting the number of structures in a collection,
- (Combinatorial design) proving a collection is non-empty,
- (Extremal combinatorics) finding maximal/minimal objects in a collection,
- (Graph theory).
Algebraic/probabilistic/analytic methods are all useful in combinatorics.
For problems studying the complexity of computations on discrete structures, ds.algorithms or cc.complexity-theory is more appropriate.
