Question

Performing this process on the 2-dimensional plane is the subject of the Hadwiger-Nelson problem. Certain objects are partitioned into Class 1 and Class 2 by a variant of this process, according to Vizing’s Theorem. This process results in a value of delta-G in exactly 2 cases by Brooks’ Theorem. This process’s associated quantity is denoted chi, for which Hadwiger’s conjecture states that chi equals t implies a K-t minor. As this process amounts to a partition into independent sets, a value of 2 for that quantity implies (*) bipartiteness. A conjecture about this process was resolved using (10[1])discharging in a controversial computer-assisted proof by Appel and Haken. For 10 points, what process may be done using at most four (10[4])labels without any adjacency (10[1])conflicts, according to a namesake theorem about planar maps? ■END■

ANSWER: graph coloring [accept anything that describes determining the chromatic number; accept vertex coloring; accept edge coloring]
<Science - Other Science>
= Average correct buzz position

Back to tossups

Buzzes

PlayerTeamOpponentBuzz PositionValue
Matthew SiffYaleLehigh A9610
Eshan PantNYU ABard11810
Austin GuoPrincetonColumbia B11810
Kushal AluruRutgersGatherer11810
Mihir ShettyColumbia CNYU B11810
Derek ChenColumbia ANYU C12210

Summary

2024 Booster Shot (Columbia)02/23/2024Y6100%0%0%115.00
2024 Booster Shot (Waterloo)02/23/2024Y4100%0%0%94.25
2024 Booster Shot (Vanderbilt)03/02/2024Y4100%25%0%101.75
2024 Booster Shot (Great Lakes)03/09/2024Y7100%43%14%89.43
2024 Booster Shot (WUSTL)03/09/2024Y3100%0%0%114.33