Solved problems

Titlesort iconAuthor(s)Imp.¹Rec.²Area » Topic » SubtopicPosted by
Distributivity of a lattice of funcoids is not provable without axiom of choicePorton0Topologyporton
DIS-PROOF OF BEALS CONJECTURE✭✭✭0Number Theory » Additive N.T.lalitha
Difference between neighbors in a matrixVadim Lioubimov1Combinatorics » MatricesVadim Lioubimov
Decomposing the truncated octahedron into parallelepipeds1Geometry » Polytopesmdevos
Composition of reloids expressed through atomic reloidsPorton✭✭0Topologyporton
Composition of atomic reloidsPorton✭✭0Topologyporton
Complexity of QBF(Bounded Treewidth)Moshe Y. Vardi✭✭0Logic » Finite Model Theorymyvardi
Colouring $d$-degenerate graphs with large girthWood✭✭1Graph Theory » ColoringDavid Wood
Coloring squares of hypercubesWan✭✭1Graph Theory » Coloring » Vertex coloringmdevos
Coatoms of the lattice of funcoidsPorton0Topologyporton
Co-separability of filter objectsPorton✭✭0Unsortedporton
Choice number of complete multipartite graphs with parts of size 41Graph Theory » Coloring » Vertex coloringJon Noel
Characterization of monovalued reloids with atomic domainsPorton✭✭0Topologyporton
Chain-meet-closed setsPorton✭✭0Unsortedporton
Bounding the chromatic number of graphs with no odd holeGyarfas✭✭✭0Graph Theory » Coloring » Vertex coloringmdevos
Bounded colorings for planar graphsAlon; Ding; Oporowski; Vertigan✭✭1Graph Theory » Topological G.T. » Coloringmdevos
Bigger cycles in cubic graphs✭✭0Graph Theory » Basic G.T. » Cyclesmdevos
Atomic reloids are monovaluedPorton✭✭0Topologyporton
Alon-Saks-Seymour ConjectureAlon; Saks; Seymour✭✭✭0Graph Theory » Coloring » Vertex coloringmdevos
A construction of direct product in the category of continuous maps between endo-funcoidsPorton✭✭✭0Topologyporton
5-coloring graphs with small crossing & clique numbersOporowski; Zhao✭✭1Graph Theory » Topological G.T. » Coloringmdevos
(2 + epsilon)-flow conjectureGoddyn; Seymour✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos