hasWeakerFormulation

P185415
predicate

Indicates that one formulation of a statement, rule, or condition is logically or practically less strict, less powerful, or less demanding than another related formulation.

Sample triples (1)

Subject Object
Pósa’s theorem in graph theory
surface form: Pósa’s theorem
If G is a graph on n ≥ 3 vertices with degree sequence d1 ≤ d2 ≤ … ≤ dn and for every integer k with 1 ≤ k < n/2, dk ≥ k+1 or dn−k ≥ n−k, then G has a Hamiltonian cycle