Basic Combinatorics

Santosh Kumar Yadav ()
Additional contact information
Santosh Kumar Yadav: Shri Jagdishprasad Jhabarmal Tibrewala University

Chapter Chapter 2 in Discrete Mathematics with Graph Theory, 2023, pp 67-113 from Springer

Abstract: Abstract An important part of discrete mathematics is combinatorics which is used to solve counting problems without enumerating all possible cases. Combinatorics deals with counting the number of ways of arranging or choosing objects from a finite set according to certain specific rules or methods.

Date: 2023
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-031-21321-2_2

Ordering information: This item can be ordered from
http://www.springer.com/9783031213212

DOI: 10.1007/978-3-031-21321-2_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().