{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IZVHCTTU3HA2KDQEOAMDCMHBL5","short_pith_number":"pith:IZVHCTTU","schema_version":"1.0","canonical_sha256":"466a714e74d9c1a50e0470183130e15f7a39c78d41b35a629ebb4ba48e54211e","source":{"kind":"arxiv","id":"1811.07221","version":1},"attestation_state":"computed","paper":{"title":"Induced subgraphs with many repeated degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Raphael Yuster, Yair Caro","submitted_at":"2018-11-17T21:08:01Z","abstract_excerpt":"Erd\\H{o}s, Fajtlowicz and Staton asked for the least integer $f(k)$ such that every graph with more than $f(k)$ vertices has an induced regular subgraph with at least $k$ vertices. Here we consider the following relaxed notions. Let $g(k)$ be the least integer such that every graph with more than $g(k)$ vertices has an induced subgraph with at least $k$ repeated degrees and let $h(k)$ be the least integer such that every graph with more than $h(k)$ vertices has an induced subgraph with at least $k$ maximum degree vertices. We obtain polynomial lower bounds for $h(k)$ and $g(k)$ and nontrivial "},"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":"1811.07221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-17T21:08:01Z","cross_cats_sorted":[],"title_canon_sha256":"cff34d1df2e18836d17d28a2342e4178fb6d1f48adc1f14cb9c64329fbacecaa","abstract_canon_sha256":"631b01b30db5a10f36667fb3b960da91bf6518ec60f9c5c28c62eff9a01498f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:28.607161Z","signature_b64":"0Nsl9lYOt+rgP/sFlR1Ap6mpXdpqbzxtjh6NLCKfcIDoSZegUFmXgC0W46g3Tsi6YkkTALqeHxO1gJJfEXaSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"466a714e74d9c1a50e0470183130e15f7a39c78d41b35a629ebb4ba48e54211e","last_reissued_at":"2026-05-18T00:00:28.606724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:28.606724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced subgraphs with many repeated degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Raphael Yuster, Yair Caro","submitted_at":"2018-11-17T21:08:01Z","abstract_excerpt":"Erd\\H{o}s, Fajtlowicz and Staton asked for the least integer $f(k)$ such that every graph with more than $f(k)$ vertices has an induced regular subgraph with at least $k$ vertices. Here we consider the following relaxed notions. Let $g(k)$ be the least integer such that every graph with more than $g(k)$ vertices has an induced subgraph with at least $k$ repeated degrees and let $h(k)$ be the least integer such that every graph with more than $h(k)$ vertices has an induced subgraph with at least $k$ maximum degree vertices. We obtain polynomial lower bounds for $h(k)$ and $g(k)$ and nontrivial "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07221","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":"1811.07221","created_at":"2026-05-18T00:00:28.606792+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.07221v1","created_at":"2026-05-18T00:00:28.606792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07221","created_at":"2026-05-18T00:00:28.606792+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZVHCTTU3HA2","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZVHCTTU3HA2KDQE","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZVHCTTU","created_at":"2026-05-18T12:32:31.084164+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/IZVHCTTU3HA2KDQEOAMDCMHBL5","json":"https://pith.science/pith/IZVHCTTU3HA2KDQEOAMDCMHBL5.json","graph_json":"https://pith.science/api/pith-number/IZVHCTTU3HA2KDQEOAMDCMHBL5/graph.json","events_json":"https://pith.science/api/pith-number/IZVHCTTU3HA2KDQEOAMDCMHBL5/events.json","paper":"https://pith.science/paper/IZVHCTTU"},"agent_actions":{"view_html":"https://pith.science/pith/IZVHCTTU3HA2KDQEOAMDCMHBL5","download_json":"https://pith.science/pith/IZVHCTTU3HA2KDQEOAMDCMHBL5.json","view_paper":"https://pith.science/paper/IZVHCTTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.07221&json=true","fetch_graph":"https://pith.science/api/pith-number/IZVHCTTU3HA2KDQEOAMDCMHBL5/graph.json","fetch_events":"https://pith.science/api/pith-number/IZVHCTTU3HA2KDQEOAMDCMHBL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZVHCTTU3HA2KDQEOAMDCMHBL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZVHCTTU3HA2KDQEOAMDCMHBL5/action/storage_attestation","attest_author":"https://pith.science/pith/IZVHCTTU3HA2KDQEOAMDCMHBL5/action/author_attestation","sign_citation":"https://pith.science/pith/IZVHCTTU3HA2KDQEOAMDCMHBL5/action/citation_signature","submit_replication":"https://pith.science/pith/IZVHCTTU3HA2KDQEOAMDCMHBL5/action/replication_record"}},"created_at":"2026-05-18T00:00:28.606792+00:00","updated_at":"2026-05-18T00:00:28.606792+00:00"}