Finite Lattice Representation Problem ★★★★

Author(s):

Conjecture  

There exists a finite lattice which is not the congruence lattice of a finite algebra.

Keywords: congruence lattice; finite algebra

Outer reloid of restricted funcoid ★★

Author(s): Porton

Question   $ ( \mathsf{RLD})_{\mathrm{out}} (f \cap^{\mathsf{FCD}} ( \mathcal{A} \times^{\mathsf{FCD}} \mathcal{B})) = (( \mathsf{RLD})_{\mathrm{out}} f) \cap^{\mathsf{RLD}} ( \mathcal{A} \times^{\mathsf{RLD}} \mathcal{B}) $ for every filter objects $ \mathcal{A} $ and $ \mathcal{B} $ and a funcoid $ f\in\mathsf{FCD}(\mathrm{Src}\,f; \mathrm{Dst}\,f) $?

Keywords: direct product of filters; outer reloid

Domain and image of inner reloid ★★

Author(s): Porton

Conjecture   $ \ensuremath{\operatorname{dom}}( \mathsf{\ensuremath{\operatorname{RLD}}})_{\ensuremath{\operatorname{in}}} f =\ensuremath{\operatorname{dom}}f $ and $ \ensuremath{\operatorname{im}}( \mathsf{\ensuremath{\operatorname{RLD}}})_{\ensuremath{\operatorname{in}}} f =\ensuremath{\operatorname{im}}f $ for every funcoid $ f $.

Keywords: domain; funcoids; image; reloids

Star chromatic index of complete graphs ★★

Author(s): Dvorak; Mohar; Samal

Conjecture   Is it possible to color edges of the complete graph $ K_n $ using $ O(n) $ colors, so that the coloring is proper and no 4-cycle and no 4-edge path is using only two colors?

Equivalently: is the star chromatic index of $ K_n $ linear in $ n $?

Keywords: complete graph; edge coloring; star coloring