{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6FVUYKFDDUSJKKEYOS4QXTJXLT","short_pith_number":"pith:6FVUYKFD","schema_version":"1.0","canonical_sha256":"f16b4c28a31d2495289874b90bcd375ceddad2781a0f879536eff2d359399a89","source":{"kind":"arxiv","id":"1512.07852","version":1},"attestation_state":"computed","paper":{"title":"On graphs decomposable into induced matchings of linear sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Hao Huang, Jacob Fox","submitted_at":"2015-12-24T16:27:55Z","abstract_excerpt":"We call a graph $G$ an $(r,t)$-Ruzsa-Szemer\\'edi graph if its edge set can be partitioned into $t$ edge-disjoint induced matchings, each of size $r$. These graphs were introduced in 1978 and has been extensively studied since then. In this paper, we consider the case when $r=cn$. For $c>1/4$, we determine the maximum possible $t$ which is a constant depending only on $c$. On the other hand, when $c=1/4$, there could be as many as $\\Omega(\\log n)$ induced matchings. We prove that this bound is tight up to a constant factor. Finally, when $c$ is fixed strictly between $1/5$ and $1/4$, we give a "},"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":"1512.07852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-24T16:27:55Z","cross_cats_sorted":[],"title_canon_sha256":"fee5dea631cc5f997cea8f5f7dd400492ae0239b887d21004af5e76a72ff9d80","abstract_canon_sha256":"cf3578bb7b532f0a12087517a965d63ff1f8dac24ee3eaede3ad5ac71c8162e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:47.647770Z","signature_b64":"vUBPsHkO69E76z7lJzMWeQS+wsJrM6m1qTcN8a6Orz/6mUJ3kNEm5tHKA5qbYp4M3U34VYMe2oh3gbW5t/PzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f16b4c28a31d2495289874b90bcd375ceddad2781a0f879536eff2d359399a89","last_reissued_at":"2026-05-18T01:23:47.647031Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:47.647031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On graphs decomposable into induced matchings of linear sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Hao Huang, Jacob Fox","submitted_at":"2015-12-24T16:27:55Z","abstract_excerpt":"We call a graph $G$ an $(r,t)$-Ruzsa-Szemer\\'edi graph if its edge set can be partitioned into $t$ edge-disjoint induced matchings, each of size $r$. These graphs were introduced in 1978 and has been extensively studied since then. In this paper, we consider the case when $r=cn$. For $c>1/4$, we determine the maximum possible $t$ which is a constant depending only on $c$. On the other hand, when $c=1/4$, there could be as many as $\\Omega(\\log n)$ induced matchings. We prove that this bound is tight up to a constant factor. Finally, when $c$ is fixed strictly between $1/5$ and $1/4$, we give a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07852","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":"1512.07852","created_at":"2026-05-18T01:23:47.647145+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.07852v1","created_at":"2026-05-18T01:23:47.647145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07852","created_at":"2026-05-18T01:23:47.647145+00:00"},{"alias_kind":"pith_short_12","alias_value":"6FVUYKFDDUSJ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6FVUYKFDDUSJKKEY","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6FVUYKFD","created_at":"2026-05-18T12:29:07.941421+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/6FVUYKFDDUSJKKEYOS4QXTJXLT","json":"https://pith.science/pith/6FVUYKFDDUSJKKEYOS4QXTJXLT.json","graph_json":"https://pith.science/api/pith-number/6FVUYKFDDUSJKKEYOS4QXTJXLT/graph.json","events_json":"https://pith.science/api/pith-number/6FVUYKFDDUSJKKEYOS4QXTJXLT/events.json","paper":"https://pith.science/paper/6FVUYKFD"},"agent_actions":{"view_html":"https://pith.science/pith/6FVUYKFDDUSJKKEYOS4QXTJXLT","download_json":"https://pith.science/pith/6FVUYKFDDUSJKKEYOS4QXTJXLT.json","view_paper":"https://pith.science/paper/6FVUYKFD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.07852&json=true","fetch_graph":"https://pith.science/api/pith-number/6FVUYKFDDUSJKKEYOS4QXTJXLT/graph.json","fetch_events":"https://pith.science/api/pith-number/6FVUYKFDDUSJKKEYOS4QXTJXLT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6FVUYKFDDUSJKKEYOS4QXTJXLT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6FVUYKFDDUSJKKEYOS4QXTJXLT/action/storage_attestation","attest_author":"https://pith.science/pith/6FVUYKFDDUSJKKEYOS4QXTJXLT/action/author_attestation","sign_citation":"https://pith.science/pith/6FVUYKFDDUSJKKEYOS4QXTJXLT/action/citation_signature","submit_replication":"https://pith.science/pith/6FVUYKFDDUSJKKEYOS4QXTJXLT/action/replication_record"}},"created_at":"2026-05-18T01:23:47.647145+00:00","updated_at":"2026-05-18T01:23:47.647145+00:00"}