{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:G6V4MQULN76GCWHJ3F27ESVHQI","short_pith_number":"pith:G6V4MQUL","schema_version":"1.0","canonical_sha256":"37abc6428b6ffc6158e9d975f24aa7821e53d0bfbdfc0945ba13f88d8605cc0a","source":{"kind":"arxiv","id":"2004.08718","version":1},"attestation_state":"computed","paper":{"title":"Maximal degrees in subgraphs of Kneser graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Peter Frankl","submitted_at":"2020-04-18T22:39:06Z","abstract_excerpt":"In this paper, we study the maximum degree in non-empty induced subgraphs of the Kneser graph $KG(n,k)$. One of the main results asserts that, for $k>k_0$ and $n>64k^2$, whenever a non-empty subgraph has $m\\ge k{n-2\\choose k-2}$ vertices, its maximum degree is at least $\\frac 12(1-\\frac {k^2}n) m - {n-2\\choose k-2}\\ge 0.49 m$. This bound is essentially best possible. One of the intermediate steps is to obtain structural results on non-empty subgraphs with small maximum degree."},"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":"2004.08718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-18T22:39:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6f1b62a8ece5113d024fe456f69f717440c47bdebb2588a6cee6cea7a262de79","abstract_canon_sha256":"08006084c48b32f0ef149b55faac41ebf82acb4f8de046966c3f47e0442c00fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:56:08.773048Z","signature_b64":"hjzlAep0nb1+1x6wpIO8iV/aa7Wyjvx+l29zxLtnmQNp6nr18OBAYwRGOT08w8EsOKsFasSBBSFaVTWiOEydBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37abc6428b6ffc6158e9d975f24aa7821e53d0bfbdfc0945ba13f88d8605cc0a","last_reissued_at":"2026-07-05T00:56:08.772669Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:56:08.772669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximal degrees in subgraphs of Kneser graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Peter Frankl","submitted_at":"2020-04-18T22:39:06Z","abstract_excerpt":"In this paper, we study the maximum degree in non-empty induced subgraphs of the Kneser graph $KG(n,k)$. One of the main results asserts that, for $k>k_0$ and $n>64k^2$, whenever a non-empty subgraph has $m\\ge k{n-2\\choose k-2}$ vertices, its maximum degree is at least $\\frac 12(1-\\frac {k^2}n) m - {n-2\\choose k-2}\\ge 0.49 m$. This bound is essentially best possible. One of the intermediate steps is to obtain structural results on non-empty subgraphs with small maximum degree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.08718","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.08718/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2004.08718","created_at":"2026-07-05T00:56:08.772735+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.08718v1","created_at":"2026-07-05T00:56:08.772735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.08718","created_at":"2026-07-05T00:56:08.772735+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6V4MQULN76G","created_at":"2026-07-05T00:56:08.772735+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6V4MQULN76GCWHJ","created_at":"2026-07-05T00:56:08.772735+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6V4MQUL","created_at":"2026-07-05T00:56:08.772735+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/G6V4MQULN76GCWHJ3F27ESVHQI","json":"https://pith.science/pith/G6V4MQULN76GCWHJ3F27ESVHQI.json","graph_json":"https://pith.science/api/pith-number/G6V4MQULN76GCWHJ3F27ESVHQI/graph.json","events_json":"https://pith.science/api/pith-number/G6V4MQULN76GCWHJ3F27ESVHQI/events.json","paper":"https://pith.science/paper/G6V4MQUL"},"agent_actions":{"view_html":"https://pith.science/pith/G6V4MQULN76GCWHJ3F27ESVHQI","download_json":"https://pith.science/pith/G6V4MQULN76GCWHJ3F27ESVHQI.json","view_paper":"https://pith.science/paper/G6V4MQUL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.08718&json=true","fetch_graph":"https://pith.science/api/pith-number/G6V4MQULN76GCWHJ3F27ESVHQI/graph.json","fetch_events":"https://pith.science/api/pith-number/G6V4MQULN76GCWHJ3F27ESVHQI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6V4MQULN76GCWHJ3F27ESVHQI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6V4MQULN76GCWHJ3F27ESVHQI/action/storage_attestation","attest_author":"https://pith.science/pith/G6V4MQULN76GCWHJ3F27ESVHQI/action/author_attestation","sign_citation":"https://pith.science/pith/G6V4MQULN76GCWHJ3F27ESVHQI/action/citation_signature","submit_replication":"https://pith.science/pith/G6V4MQULN76GCWHJ3F27ESVHQI/action/replication_record"}},"created_at":"2026-07-05T00:56:08.772735+00:00","updated_at":"2026-07-05T00:56:08.772735+00:00"}