Y by RedFireTruck, ImSh95, Adventure10
EFL conjecture: Let be a graph consisting of copies of , every pair of which has at most one vertex in common. Then, .
Curve EFL conjecture: Let be a set of curves such that every pair has at most one point in common. Then, has an EFL coloring with colors.
EFL conjecture Curve EFL conjecture
Within any given set of curves, imaginary points can be added to each curve so that Graph is composed of
's while also ensuring that each has a maximum of one intersection. Thus, the EFL conjecture implies the Curve EFL conjecture.
Curve EFL conjecture EFL conjecture
Within any graph , m curves (1, . . . , m) can be added so that each 's intersections are intersections of the curves as well. Thus, the Curve EFL conjecture implies the EFL conjecture.
Since the two conjectures imply each other, they are equivalent.
Curve EFL conjecture: Let be a set of curves such that every pair has at most one point in common. Then, has an EFL coloring with colors.
EFL conjecture Curve EFL conjecture
Within any given set of curves, imaginary points can be added to each curve so that Graph is composed of
's while also ensuring that each has a maximum of one intersection. Thus, the EFL conjecture implies the Curve EFL conjecture.
Curve EFL conjecture EFL conjecture
Within any graph , m curves (1, . . . , m) can be added so that each 's intersections are intersections of the curves as well. Thus, the Curve EFL conjecture implies the EFL conjecture.
Since the two conjectures imply each other, they are equivalent.
This post has been edited 1 time. Last edited by notethanol, Dec 1, 2019, 11:00 AM