{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:37SRE3NO73JQ6K3VBPTOY37GYW","short_pith_number":"pith:37SRE3NO","schema_version":"1.0","canonical_sha256":"dfe5126daefed30f2b750be6ec6fe6c5b836011ce2ae230840bb9e209a2a1fd8","source":{"kind":"arxiv","id":"2106.09688","version":2},"attestation_state":"computed","paper":{"title":"A Ramsey-Tur\\'an theory for tilings in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Donglei Yang, Guanghui Wang, Jie Han, Patrick Morris","submitted_at":"2021-06-17T17:40:31Z","abstract_excerpt":"For a $k$-vertex graph $F$ and an $n$-vertex graph $G$, an $F$-tiling in $G$ is a collection of vertex-disjoint copies of $F$ in $G$. For $r\\in \\mathbb{N}$, the $r$-independence number of $G$, denoted $\\alpha_r(G)$, is the largest size of a $K_r$-free set of vertices in $G$. In this paper, we discuss Ramsey--Tur\\'an-type theorems for tilings where one is interested in minimum degree and independence number conditions (and the interaction between the two) that guarantee the existence of optimal $F$-tilings. For cliques, we show that for any $k\\geq 3$ and $\\eta>0$, any graph $G$ on $n$ vertices "},"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":"2106.09688","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-06-17T17:40:31Z","cross_cats_sorted":[],"title_canon_sha256":"138d9a729e9242dfd2cc2aa6ddbe3c60ea8bfb46fa784c8eb5261ee0c5c98197","abstract_canon_sha256":"7be22713da37752f269cfd99623c69a7311e84b90d883a1c8746c3a3fc6ea7a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:13:42.121203Z","signature_b64":"tJ/oKW9PFDQIX1KkwOXYQMoNQk2MwfCRMPZgCg9KLcYnQHxvnKE7mi1AOw5oYSqzDrLt3KSKzhOyQ3dzg+a4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfe5126daefed30f2b750be6ec6fe6c5b836011ce2ae230840bb9e209a2a1fd8","last_reissued_at":"2026-06-23T03:13:42.120559Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:13:42.120559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Ramsey-Tur\\'an theory for tilings in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Donglei Yang, Guanghui Wang, Jie Han, Patrick Morris","submitted_at":"2021-06-17T17:40:31Z","abstract_excerpt":"For a $k$-vertex graph $F$ and an $n$-vertex graph $G$, an $F$-tiling in $G$ is a collection of vertex-disjoint copies of $F$ in $G$. For $r\\in \\mathbb{N}$, the $r$-independence number of $G$, denoted $\\alpha_r(G)$, is the largest size of a $K_r$-free set of vertices in $G$. In this paper, we discuss Ramsey--Tur\\'an-type theorems for tilings where one is interested in minimum degree and independence number conditions (and the interaction between the two) that guarantee the existence of optimal $F$-tilings. For cliques, we show that for any $k\\geq 3$ and $\\eta>0$, any graph $G$ on $n$ vertices "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.09688","kind":"arxiv","version":2},"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/2106.09688/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":"2106.09688","created_at":"2026-06-23T03:13:42.120649+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.09688v2","created_at":"2026-06-23T03:13:42.120649+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.09688","created_at":"2026-06-23T03:13:42.120649+00:00"},{"alias_kind":"pith_short_12","alias_value":"37SRE3NO73JQ","created_at":"2026-06-23T03:13:42.120649+00:00"},{"alias_kind":"pith_short_16","alias_value":"37SRE3NO73JQ6K3V","created_at":"2026-06-23T03:13:42.120649+00:00"},{"alias_kind":"pith_short_8","alias_value":"37SRE3NO","created_at":"2026-06-23T03:13:42.120649+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/37SRE3NO73JQ6K3VBPTOY37GYW","json":"https://pith.science/pith/37SRE3NO73JQ6K3VBPTOY37GYW.json","graph_json":"https://pith.science/api/pith-number/37SRE3NO73JQ6K3VBPTOY37GYW/graph.json","events_json":"https://pith.science/api/pith-number/37SRE3NO73JQ6K3VBPTOY37GYW/events.json","paper":"https://pith.science/paper/37SRE3NO"},"agent_actions":{"view_html":"https://pith.science/pith/37SRE3NO73JQ6K3VBPTOY37GYW","download_json":"https://pith.science/pith/37SRE3NO73JQ6K3VBPTOY37GYW.json","view_paper":"https://pith.science/paper/37SRE3NO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.09688&json=true","fetch_graph":"https://pith.science/api/pith-number/37SRE3NO73JQ6K3VBPTOY37GYW/graph.json","fetch_events":"https://pith.science/api/pith-number/37SRE3NO73JQ6K3VBPTOY37GYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37SRE3NO73JQ6K3VBPTOY37GYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37SRE3NO73JQ6K3VBPTOY37GYW/action/storage_attestation","attest_author":"https://pith.science/pith/37SRE3NO73JQ6K3VBPTOY37GYW/action/author_attestation","sign_citation":"https://pith.science/pith/37SRE3NO73JQ6K3VBPTOY37GYW/action/citation_signature","submit_replication":"https://pith.science/pith/37SRE3NO73JQ6K3VBPTOY37GYW/action/replication_record"}},"created_at":"2026-06-23T03:13:42.120649+00:00","updated_at":"2026-06-23T03:13:42.120649+00:00"}