MATH3260 · 10
Chapter outline · Coloring and extremal graph theory
Definitions and theorem statements recorded in the web, in note order, with the exact proof steps behind their recorded connections.
0 of 6 public sections have indexed statements. This outline covers only those statements, not every theorem in the chapter. Recorded connections are still being reviewed.
Chromatic polynomials and deletion–contraction
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Bipartite edge colors and alternating repairs
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Fans, two-color repairs and the general edge-coloring bound
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Degeneracy, contraction and five planar colors
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Finite Ramsey bounds and random colorings
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Clique-free extremal graphs and balanced parts
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.