I wonder about the difference between the two areas combinatorics and discrete mathematics. On closer inspection, I was unable to pinpoint any concrete difference so far.
Here are a few thoughts:
It might be about the "advancedness". My impression is that dicrete math is mostly used in connection with freshman courses. (Discrete mathematics for computer scientists, etc.), with the notable exception of the journal Discrete Mathematics. While I know about quite a few combinatorialists, I do not remember any mathematician describing himself as a discrete mathematician. So maybe the situation is a bit like calculus vs analysis: Discrete mathematics is basic, combinatorics is advanced.
It might be connected to the historical development. My impression is that combinatorics was considered for quite some time as being restricted to basic counting operations based on permutations, combinations, binomial coefficients etc., resulting in combinatorics being a subfield of discrete mathematics. But if you look at modern definitions of combinatorics, they all agree that it is hard to give a precise definition, but also they agree that besides enumerative combinatorics (which is all the counting techniques lik generating functions, Pólya theory, Möbius inversion etc.), combinatorics includes the study of various combinatorial structures, like posets, graphs, matroids, finite geometries, combinatorial designs, error correcting codes etc.
So if "combinatorics is a subset of discrete mathematics" should indeed be true: I would like to see a concrete example of a subject being discrete math, but not combinatorics.
I was a bit surprised to find that the (oldschool?) viewpoint "combinatorics = counting" is also suggested by our MSE tag descriptions. From the tag description "discrete mathematics:
For questions about the study of finite or countable discrete structures, especially how to count or enumerate elements in a set (perhaps of all possibilities) or any subset. It includes questions on permutations, combinations, bijective proofs, and generating functions.
From the tag description discrete mathematics
Consider using a more specific tag instead, such as: (combinatorics), [...]
Also note that on MSE, synonyms of combinatorics are enumerative-combinatorics (I don't agree, the existence of this refined notion clearly indicates that it is a subfield) and counting (I don't agree for the same reason, plus having the "elementary" feeling attached).
Addition: I've looked at two reputable books on combinatorics to see what they include. Here is a selection from their table of contents:
- J. H. van Lint, R.M. Wilson. "A Course in Combinatorics": Graphs, Colorings of graphs and Ramsey's theorem, Flows in networks, Latin squares, Hadamard matrices, Codes and designs, Strongly regular graphs, Projective and combinatorial geometries, Association schemes.
- Peter J. Cameron. "Combinatorics": Latin squares, Finite geometry, Ramsey's Theorem, Graphs, Designs, Error-correcting codes, Graph colorings.