Topic: Graph Parameters and Inequalities

Wilf’s Chromatic Bound from Critical Subgraphs

Universal Inequalities for Independence, Clique, and Coloring

The Caro-Wei Bound: Random Ordering Proof

Spectral Radius of a Graph

Parameter Arithmetic for Unions and Joins

Minimum Degree and Spectral Radius of Subgraphs

Independence and Clique Numbers as Optimization Parameters

Critical Graphs and Minimum-Degree Constraints

Computing Parameters on Paths, Cycles, and Complete Bipartite Graphs

Complementation and Dualities Among Graph Parameters