Triple

T36363521
Position Surface form Disambiguated ID Type / Status
Subject Pósa’s theorem E895558 entity
Predicate hasFormulation P3660 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 d_{n−k} ≥ n−k, then G is Hamiltonian — LITERAL FINISHED

Provenance (2 batches)

Stage Batch ID Job type Status
creating batch_69f76e5044248190b390d8887dc03254 elicitation completed
NER batch_69f7bacb7a70819083e74d2cfa28cf36 ner completed
Created at: May 3, 2026, 4:10 p.m.