Explicit Near-Fully X-Ramanujan Graphs

This course covers the learning outcomes and goals of understanding explicit near-fully X-Ramanujan graphs. It teaches the skills of analyzing Ramanujan graphs, exploring random finite graphs resembling infinite graphs, and delving into adjacency matrices and formal polynomials. The teaching method involves discussing finite permutations, matrix-weighted polynomials, presenting results, and highlighting open problems. The intended audience for this course includes individuals interested in graph theory, spectral graph theory, and combinatorics.