This is the first talk of Gwangju Combinatorics Seminar. Bijective proof is an essential tool in discrete mathematics. In many instances, finding a suitable bijection is a key step of a proof.This talk introduces combinatorial bijections used to prove some properties of derangements, set partitions and pattern avoiding permutations.
TBA