{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1996:O6WBB7MEPSLU3JVNJ3XCSWV4L3","short_pith_number":"pith:O6WBB7ME","schema_version":"1.0","canonical_sha256":"77ac10fd847c974da6ad4eee295abc5eedcf7237e50acc7081154432fe40b195","source":{"kind":"arxiv","id":"math/9612212","version":1},"attestation_state":"computed","paper":{"title":"On $k$-ordered Hamiltonian Graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gabor N. Sarkozy, Stanley Selkow","submitted_at":"1996-12-04T00:00:00Z","abstract_excerpt":"A Hamiltonian graph $G$ of order $n$ is $k$-ordered, $2\\leq k \\leq n$, if for every sequence $v_1, v_2, \\ldots ,v_k$ of $k$ distinct vertices of $G$, there exists a Hamiltonian cycle that encounters $v_1, v_2, \\ldots , v_k$ in this order. In this paper, answering a question of Ng and Schultz, we give a sharp bound for the minimum degree guaranteeing that a graph is a $k$-ordered Hamiltonian graph under some mild restrictions. More precisely, we show that there are $\\varepsilon, n_0> 0$ such that if $G$ is a graph of order $n\\geq n_0$ with minimum degree at least $\\lceil \\frac{n}{2} \\rceil + \\l"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"math/9612212","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"1996-12-04T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"0ab5bd0f6e58e4baac85f768618e00ff86cd4132be7f9adcced00056f89a4be6","abstract_canon_sha256":"c490a319f6008dff240fefac8d7203a8e7f7b6c6d0902f583d100129ea24b766"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:37.383643Z","signature_b64":"1CzbtbHSyhpi6XfYhnNxzcu3mVu/pofBbZD1EE/Q3KB5DvwRIZt4MrGu3jBOYwIPAmRboR8AIp7gzX9JsFYPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77ac10fd847c974da6ad4eee295abc5eedcf7237e50acc7081154432fe40b195","last_reissued_at":"2026-05-18T01:05:37.383074Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:37.383074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On $k$-ordered Hamiltonian Graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gabor N. Sarkozy, Stanley Selkow","submitted_at":"1996-12-04T00:00:00Z","abstract_excerpt":"A Hamiltonian graph $G$ of order $n$ is $k$-ordered, $2\\leq k \\leq n$, if for every sequence $v_1, v_2, \\ldots ,v_k$ of $k$ distinct vertices of $G$, there exists a Hamiltonian cycle that encounters $v_1, v_2, \\ldots , v_k$ in this order. In this paper, answering a question of Ng and Schultz, we give a sharp bound for the minimum degree guaranteeing that a graph is a $k$-ordered Hamiltonian graph under some mild restrictions. More precisely, we show that there are $\\varepsilon, n_0> 0$ such that if $G$ is a graph of order $n\\geq n_0$ with minimum degree at least $\\lceil \\frac{n}{2} \\rceil + \\l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9612212","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/9612212","created_at":"2026-05-18T01:05:37.383182+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9612212v1","created_at":"2026-05-18T01:05:37.383182+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9612212","created_at":"2026-05-18T01:05:37.383182+00:00"},{"alias_kind":"pith_short_12","alias_value":"O6WBB7MEPSLU","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_16","alias_value":"O6WBB7MEPSLU3JVN","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_8","alias_value":"O6WBB7ME","created_at":"2026-05-18T12:25:48.327863+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O6WBB7MEPSLU3JVNJ3XCSWV4L3","json":"https://pith.science/pith/O6WBB7MEPSLU3JVNJ3XCSWV4L3.json","graph_json":"https://pith.science/api/pith-number/O6WBB7MEPSLU3JVNJ3XCSWV4L3/graph.json","events_json":"https://pith.science/api/pith-number/O6WBB7MEPSLU3JVNJ3XCSWV4L3/events.json","paper":"https://pith.science/paper/O6WBB7ME"},"agent_actions":{"view_html":"https://pith.science/pith/O6WBB7MEPSLU3JVNJ3XCSWV4L3","download_json":"https://pith.science/pith/O6WBB7MEPSLU3JVNJ3XCSWV4L3.json","view_paper":"https://pith.science/paper/O6WBB7ME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9612212&json=true","fetch_graph":"https://pith.science/api/pith-number/O6WBB7MEPSLU3JVNJ3XCSWV4L3/graph.json","fetch_events":"https://pith.science/api/pith-number/O6WBB7MEPSLU3JVNJ3XCSWV4L3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O6WBB7MEPSLU3JVNJ3XCSWV4L3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O6WBB7MEPSLU3JVNJ3XCSWV4L3/action/storage_attestation","attest_author":"https://pith.science/pith/O6WBB7MEPSLU3JVNJ3XCSWV4L3/action/author_attestation","sign_citation":"https://pith.science/pith/O6WBB7MEPSLU3JVNJ3XCSWV4L3/action/citation_signature","submit_replication":"https://pith.science/pith/O6WBB7MEPSLU3JVNJ3XCSWV4L3/action/replication_record"}},"created_at":"2026-05-18T01:05:37.383182+00:00","updated_at":"2026-05-18T01:05:37.383182+00:00"}