Detailed Course Information

Select the desired Level or Schedule Type to find available classes for the course.

MATH 890AG - Topics in Combinatorics
This course will include transitivity in graphs, eigenvalues of graphs, homomorphisms of graphs, and some results from extremal set theory, particularly the Erdos-Ko-Rado theorem that can be proven using algebraic graph theory. 3.000 Credit hours 0.000 TO 3.000 Lecture hours 0.000 TO 3.000 Other hours Levels: Graduate Schedule Types: Lecture, Directed Reading, Examination Mathematics & Statistics Department Restrictions: Must be enrolled in one of the following Levels: Graduate

MATH 890AG - Topics in Combinatorics

This course will include transitivity in graphs, eigenvalues of graphs, homomorphisms of graphs, and some results from extremal set theory, particularly the Erdos-Ko-Rado theorem that can be proven using algebraic graph theory.
3.000 Credit hours
0.000 TO 3.000 Lecture hours
0.000 TO 3.000 Other hours

Levels: Graduate
Schedule Types: Lecture, Directed Reading, Examination

Mathematics & Statistics Department

Restrictions:
Must be enrolled in one of the following Levels:
Graduate

Return to Previous	New Search

Return to Previous

New Search

Skip to top of page

UR Self-Service

Detailed Course Information

© 2024 Ellucian Company L.P. and its affiliates.