
Title![]() | Author(s) | Imp.¹ | Rec.² | Subtopic | Posted by |
---|---|---|---|---|---|
Chromatic number of random lifts of complete graphs | Amit | ✭✭ | 0 | DOT | |
Coloring random subgraphs | Bukh | ✭✭ | 0 | mdevos | |
Negative association in uniform forests | Pemantle | ✭✭ | 0 | mdevos |
Imp.¹: Importance (Low ✭, Medium ✭✭, High ✭✭✭, Outstanding ✭✭✭✭)
Rec.²: Recommended for undergraduates.
Note: Resolved problems from this section may be found in Solved problems.