Examples of using Conjectured in English and their translations into Russian
{-}
-
Official
-
Colloquial
Michael D. Plummer conjectured that a similar exponential lower bound holds more generally for every 3-regular graph without cut edges,
In 1969, Branko Grünbaum conjectured that every 3-regular graph with a polyhedral embedding on any two-dimensional oriented manifold such as a torus must be of class one.
It is conjectured that 196 and other numbers that have not yet yielded a palindrome are Lychrel numbers,
Jakobsen originally conjectured that all critical graphs have an odd number of vertices,
At the Bieberbach conference in 1985, William Thurston conjectured that circle packings could be used to approximate conformal mappings.
In 1929 Dimitrie Pompeiu conjectured that any continuous function of two real variables defined on the entire plane is constant if the integral over any circle in the plane is constant.
He conjectured that this condition is also necessary: that no other values of
It is conjectured that trees are all harmonious if one vertex label is allowed to be reused.
Seese also conjectured that every family of graphs with a decidable MSO1 satisfiability problem must have bounded clique-width; this has not been proven.
Courcelle conjectured a converse to this: if a property of graphs of bounded treewidth is recognized by a tree automaton,
Chvátal conjectured that no minimally imperfect graph could have a skew partition.
Minkowski conjectured in 1900 that, whenever a cube tiling has its cubes centered at lattice points in this way, it must contain two cubes that meet face to face.
David Sumner(a graph theorist at the University of South Carolina) conjectured in 1971 that tournaments are universal graphs for polytrees.
generalized Petersen graph G(9,2), and it has been conjectured that no others exist.
Voices and conjectured dates are from Zaslaw
It has been conjectured that infinitely many Wilson primes exist, and that the number
A formal proof of a conjectured relation will then be sought- it is often easier to find a formal proof once the form of a conjectured relation is known.
Many lattice problems have been conjectured or proven to be average-case hard,
This is among the strongest upper bounds conjectured for prime gaps, even somewhat stronger than the Cramér
can be derived from a conjectured strong form of the latter.