Triple

T36363522
Position Surface form Disambiguated ID Type / Status
Subject Pósa’s theorem E895558 entity
Predicate hasWeakerFormulation P185415 FINISHED
Object 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 — LITERAL FINISHED

Provenance (4 batches)

Stage Batch ID Job type Status
creating batch_69f76e5044248190b390d8887dc03254 elicitation completed
NER batch_69f7be9d07ac8190adf796cbef60daf6 ner completed
PD batch_69f7bcccd7988190aa5c931ff347d33c pd completed
PDg batch_69f7be9b9ab481908328e0e8d8ac73d4 pdg completed
Created at: May 3, 2026, 4:10 p.m.