(graph theory) An unsolved problem in mathematics, asking for the largest possible number of edges in a bipartite graph that has a given number of vertices and has no complete bipartite subgraphs of a given size.

present participle of problem-solve

(geometry) The mathematical problem of determining the set of numbers that can be Heesch numbers.

(mathematics) The problem of generalizing Paul Gordan's computational approach to the theorem of the finiteness of generators for binary forms to work with functions having more than two variables.

(statistics) The difficulty in drawing inferences from cross-cultural data, due to the statistical phenomenon of autocorrelation.

Alternative spelling of subproblem

A concise description of a problem

(networking) The problem of optimizing a network to handle a large number of connections (roughly 10000) concurrently.

(computing theory) The problem of finding an adequate collection of axioms making up a viable description of the world for a robot or artificial intelligence.

(mathematics) The problem of deciding whether a given expression is equal to zero.