Induction In Combinatorics

Induction in Combinatorics is a proof methodology in discrete mathematics that belongs to the class of inductive reasoning techniques, distinguished by its application of mathematical induction to establish combinatorial identities, properties of recursively defined structures, and enumeration results over discrete configurations.

8

Publications

181

Citations

16

Authors

8

Institutions

Publications per year

2017–2026

0

Authors

16

  1. II
    Ilia Itenberg

    Tel Aviv University, Israel

    1 publications · 24 citations

    1

    h-index

  2. AT
    André Toom

    Universidade Federal de Pernambuco, Brazil

    1 publications · 24 citations

    1

    h-index

  3. CY
    Carl Yerger

    Georgia Institute of Technology, United States

    1 publications · 12 citations

    1

    h-index

  4. AE
    Anita E. Solow

    Grinnell College, United States

    1 publications · 27 citations

    1

    h-index

  5. SK
    Steffen König

    Bielefeld University, Germany

    1 publications · 17 citations

    1

    h-index

1–5 of 16

Venues

  1. American Mathematical Monthly

    2 publications · 51 citations

    2

    h-index

  2. Archive for Mathematical Logic

    1 publications · 20 citations

    1

    h-index

  3. Annals of Pure and Applied Logic

    1 publications · 48 citations

    1

    h-index

  4. Scholarship - Claremont (Claremont Colleges)

    Repository · 1 publications · 12 citations

    1

    h-index

  5. Mathematics Magazine

    1 publications · 21 citations

    1

    h-index

1–5