Combinatorial Proof Techniques

Combinatorial Proof Techniques is a systematic method in discrete mathematics that establishes mathematical truths by counting or analyzing finite structures in two distinct ways to demonstrate equality or derive conclusions, particularly leveraging bijective and constructive reasoning within combinatorial arguments.

171

Publications

8.4K

Citations

237

Authors

163

Institutions

Publications per year

2017–2026

16

Authors

237

  1. AT
    Arthur T. Benjamin

    Harvey Mudd College, United States

    5 publications · 76 citations

    5

    h-index

  2. DZ
    Doron Zeilberger

    Temple University, United States

    4 publications · 194 citations

    4

    h-index

  3. IM
    Ira M. Gessel

    Brandeis University, United States

    4 publications · 201 citations

    4

    h-index

  4. MB
    Miklós Bóna

    University of Florida, United States

    3 publications · 94 citations

    3

    h-index

  5. JR
    Jacob Rasmussen

    University of Cambridge, United Kingdom

    2 publications · 560 citations

    2

    h-index

1–5 of 237

Venues

  1. The Electronic Journal of Combinatorics

    22 publications · 590 citations

    15

    h-index

  2. Journal of Combinatorial Theory Series A

    11 publications · 459 citations

    11

    h-index

  3. Discrete Mathematics

    8 publications · 269 citations

    8

    h-index

  4. ArXiv.org

    Repository · 6 publications · 178 citations

    6

    h-index

  5. Proceedings of the American Mathematical Society

    PROC · 6 publications · 122 citations

    6

    h-index

1–5