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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| hasWeakerFormulation canonical | 1 |
Description generation (PDg)
The one-sentence description above was generated by prompting gpt-5.1 with the predicate name and this instruction.
Instruction
Given a predicate that represents a relationship or action between entities, generate a one-sentence description explaining its meaning. # Instructions Focus on describing the relationship, not the entities themselves. # Response Format Begin the description with \' Indicates...\'
Input
Predicate: hasWeakerFormulation
Generated description
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 ⓘ |