Search results
Results From The WOW.Com Content Network
Open problems around exact algorithms by Gerhard J. Woeginger, Discrete Applied Mathematics 156 (2008) 397–405. The RTA list of open problems – open problems in rewriting. The TLCA List of Open Problems – open problems in area typed lambda calculus
Snark (graph theory) Sparse graph. Sparse graph code; Split graph; String graph; Strongly regular graph; Threshold graph; Total graph; Tree (graph theory). Trellis (graph) Turán graph; Ultrahomogeneous graph; Vertex-transitive graph; Visibility graph. Museum guard problem; Wheel graph
Main page; Contents; Current events; Random article; About Wikipedia; Contact us
Many mathematical problems have been stated but not yet solved. These problems come from many areas of mathematics, such as theoretical physics, computer science, algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory, dynamical systems, and partial differential equations.
The reconstruction conjecture of Stanisław Ulam is one of the best-known open problems in graph theory.Using the terminology of Frank Harary [1] it can be stated as follows: If G and H are two graphs on at least three vertices and ƒ is a bijection from V(G) to V(H) such that G\{v} and H\{ƒ(v)} are isomorphic for all vertices v in V(G), then G and H are isomorphic.
In set theory and graph theory, denotes the set of n-tuples of elements of , that is, ordered sequences of elements that are not necessarily distinct. In the edge ( x , y ) {\displaystyle (x,y)} directed from x {\displaystyle x} to y {\displaystyle y} , the vertices x {\displaystyle x} and y {\displaystyle y} are called the endpoints of the ...
A hypothetical graph (or more than one) of diameter 2, girth 5, degree 57 and order 3250; the existence of such is unknown and is one of the most famous open problems in graph theory. [ 4 ] Although all the known Moore graphs are vertex-transitive graphs , the unknown one (if it exists) cannot be vertex-transitive, as its automorphism group can ...
List of unsolved problems may refer to several notable conjectures or open problems in various ... Unsolved problems in information theory; Social sciences and ...