What Is the Most Rigorous Combinatorics Book Available?

Click For Summary
SUMMARY

The discussion centers on the search for a rigorous combinatorics book that emphasizes set theory principles, specifically the sum and product counting principles, and provides formal proofs. Participants highlight the inadequacy of many existing texts, which often lack thorough explanations and rigorous proofs, particularly regarding concepts like the pigeonhole principle. Recommendations include "Set Theory" by Kunnen and "Set Theory" by Jech as suitable resources for those seeking a comprehensive understanding of combinatorial principles through a set-theoretic lens.

PREREQUISITES
  • Understanding of basic combinatorial concepts such as permutations and counting principles.
  • Familiarity with set theory, including bijections and formal proofs.
  • Knowledge of mathematical rigor and proof techniques.
  • Experience with mathematical literature and its varying levels of rigor.
NEXT STEPS
  • Research "Set Theory" by Kunnen for a rigorous approach to combinatorial principles.
  • Explore "Set Theory" by Jech for advanced set-theoretic concepts relevant to combinatorics.
  • Study formal proof techniques in mathematics to enhance understanding of rigorous arguments.
  • Investigate additional combinatorial texts that emphasize formal definitions and proofs.
USEFUL FOR

Mathematicians, students of combinatorics, and educators seeking a rigorous understanding of combinatorial principles through set theory.

SrVishi
Messages
75
Reaction score
15
Hi, I am trying to find a completely rigorous book on combinatorics. For example, one that states the sum and product counting principles in terms of set theory and proves them, treats permutations as a bijection from a set onto itself, etc. Many don't even explain the reasoning behind those principles, taking them as mere informal facts, so rigorous set theoretic definitions and proofs could at least help my intuition. It seems that even those that try to be rigorous don't live up to it. For example, some don't prove the pigeonhole principle, or do it with informal reasoning in terms of bins/balls. Other times, the attempts at "proofs" are just plain "handwavy." Could someone recommend me a good book? Thanks in advance for any response.
 
Physics news on Phys.org
A combinatorics book isn't what you want, you want a set theory book.
 
SrVishi said:
Hi, I am trying to find a completely rigorous book on combinatorics. For example, one that states the sum and product counting principles in terms of set theory and proves them, treats permutations as a bijection from a set onto itself, etc. Many don't even explain the reasoning behind those principles, taking them as mere informal facts, so rigorous set theoretic definitions and proofs could at least help my intuition. It seems that even those that try to be rigorous don't live up to it. For example, some don't prove the pigeonhole principle, or do it with informal reasoning in terms of bins/balls. Other times, the attempts at "proofs" are just plain "handwavy." Could someone recommend me a good book? Thanks in advance for any response.

Try either Kunnen's Set Theory or Jech's Set Theory.
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 46 ·
2
Replies
46
Views
6K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 6 ·
Replies
6
Views
5K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 17 ·
Replies
17
Views
12K
  • · Replies 5 ·
Replies
5
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K