{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CEEI6WT22XFDC5ZEXHMBQDINLR","short_pith_number":"pith:CEEI6WT2","schema_version":"1.0","canonical_sha256":"11088f5a7ad5ca317724b9d8180d0d5c4ec57d849a5dc5a561da8f8c8b2b6064","source":{"kind":"arxiv","id":"1111.4292","version":2},"attestation_state":"computed","paper":{"title":"Embedding spanning bipartite graphs of small bandwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Treglown, Fiachra Knox","submitted_at":"2011-11-18T07:04:42Z","abstract_excerpt":"Boettcher, Schacht and Taraz gave a condition on the minimum degree of a graph G on n vertices that ensures G contains every r-chromatic graph H on n vertices of bounded degree and of bandwidth o(n), thereby proving a conjecture of Bollobas and Komlos. We strengthen this result in the case when H is bipartite. Indeed, we give an essentially best-possible condition on the degree sequence of a graph G on n vertices that forces G to contain every bipartite graph H on n vertices of bounded degree and of bandwidth o(n). This also implies an Ore-type result. In fact, we prove a much stronger result "},"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":"1111.4292","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-18T07:04:42Z","cross_cats_sorted":[],"title_canon_sha256":"689bf4c5694eee95b9091f9f408648607ea1ec1cdbb1d6b9bc59d5003bb37ec0","abstract_canon_sha256":"58f87ce8bcce52514849c89001522440753cff7364c84063e2d49c06467d7a46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:16.883776Z","signature_b64":"LeQSEMRWZbf91QtXNhgfHXo3J/DoocJjrjMCzwd1ufsIzo8Wkt0R04oj4cKeX0r36RKWOeK8GW+4duEIsvLEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11088f5a7ad5ca317724b9d8180d0d5c4ec57d849a5dc5a561da8f8c8b2b6064","last_reissued_at":"2026-05-18T03:46:16.883066Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:16.883066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedding spanning bipartite graphs of small bandwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Treglown, Fiachra Knox","submitted_at":"2011-11-18T07:04:42Z","abstract_excerpt":"Boettcher, Schacht and Taraz gave a condition on the minimum degree of a graph G on n vertices that ensures G contains every r-chromatic graph H on n vertices of bounded degree and of bandwidth o(n), thereby proving a conjecture of Bollobas and Komlos. We strengthen this result in the case when H is bipartite. Indeed, we give an essentially best-possible condition on the degree sequence of a graph G on n vertices that forces G to contain every bipartite graph H on n vertices of bounded degree and of bandwidth o(n). This also implies an Ore-type result. In fact, we prove a much stronger result "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4292","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":""},"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":"1111.4292","created_at":"2026-05-18T03:46:16.883183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.4292v2","created_at":"2026-05-18T03:46:16.883183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4292","created_at":"2026-05-18T03:46:16.883183+00:00"},{"alias_kind":"pith_short_12","alias_value":"CEEI6WT22XFD","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CEEI6WT22XFDC5ZE","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CEEI6WT2","created_at":"2026-05-18T12:26:26.731475+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/CEEI6WT22XFDC5ZEXHMBQDINLR","json":"https://pith.science/pith/CEEI6WT22XFDC5ZEXHMBQDINLR.json","graph_json":"https://pith.science/api/pith-number/CEEI6WT22XFDC5ZEXHMBQDINLR/graph.json","events_json":"https://pith.science/api/pith-number/CEEI6WT22XFDC5ZEXHMBQDINLR/events.json","paper":"https://pith.science/paper/CEEI6WT2"},"agent_actions":{"view_html":"https://pith.science/pith/CEEI6WT22XFDC5ZEXHMBQDINLR","download_json":"https://pith.science/pith/CEEI6WT22XFDC5ZEXHMBQDINLR.json","view_paper":"https://pith.science/paper/CEEI6WT2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.4292&json=true","fetch_graph":"https://pith.science/api/pith-number/CEEI6WT22XFDC5ZEXHMBQDINLR/graph.json","fetch_events":"https://pith.science/api/pith-number/CEEI6WT22XFDC5ZEXHMBQDINLR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CEEI6WT22XFDC5ZEXHMBQDINLR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CEEI6WT22XFDC5ZEXHMBQDINLR/action/storage_attestation","attest_author":"https://pith.science/pith/CEEI6WT22XFDC5ZEXHMBQDINLR/action/author_attestation","sign_citation":"https://pith.science/pith/CEEI6WT22XFDC5ZEXHMBQDINLR/action/citation_signature","submit_replication":"https://pith.science/pith/CEEI6WT22XFDC5ZEXHMBQDINLR/action/replication_record"}},"created_at":"2026-05-18T03:46:16.883183+00:00","updated_at":"2026-05-18T03:46:16.883183+00:00"}