Overview
Description
Walks in Graphs, Posets and Sperner Property, Partitions of integers, Enumeration under Group Action, Young Tableaux, Enumeration problems in Graph Theory: Spanning Trees, Eulerian circuits, Matchings and Path-systems, Vector Spaces in Graphs, Dimension and Polynomial methods in Combinatorics, Algebraic Combinatorics Gems.
Requirements
Units
Lecture3
Catalog Details
Offering
Offered: Every Spring - Even Years
Terms
spring
Attributes
Standard
Learning Outcomes
- demonstrate understanding of combinatorial properties (like Sperner property, unimodality) and its implications in various posets.
- apply Group-theoretic results like, Burnside’s Lemma and Polya-Redfield counting for enumeration problems involving symmetries.
- demonstrate use of determinants in some enumeration problems in Graph Theory and its applications.
- apply other linear-algebraic arguments like rank, dimension, orthogonality, polynomials, etc in various combinatorial problems.