{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JSKWQEUHY36ODALAEH6CZ22KEX","short_pith_number":"pith:JSKWQEUH","schema_version":"1.0","canonical_sha256":"4c95681287c6fce1816021fc2ceb4a25f5de2d0fb7afcb04f23f94cc539e0ff9","source":{"kind":"arxiv","id":"1810.12144","version":3},"attestation_state":"computed","paper":{"title":"Dense induced bipartite subgraphs in triangle-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Matthew Kwan, Shoham Letzter, Tuan Tran","submitted_at":"2018-10-29T14:26:28Z","abstract_excerpt":"The problem of finding dense induced bipartite subgraphs in $H$-free graphs has a long history, and was posed 30 years ago by Erd\\H{o}s, Faudree, Pach and Spencer. In this paper, we obtain several results in this direction. First we prove that any $K_t$-free graph with minimum degree at least $d$ contains an induced bipartite subgraph of minimum degree at least $c_t \\log d/\\log \\log d$, confirming (asymptotically) several conjectures by Esperet, Kang and Thomass\\'e. Complementing this result, we further obtain optimal bounds for this problem in the case of dense triangle-free graphs, and we al"},"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":"1810.12144","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-29T14:26:28Z","cross_cats_sorted":[],"title_canon_sha256":"1bc80909893d516a8fb61a921c08919d7d87ae6e8431b1fc17edb209ac9e4bc9","abstract_canon_sha256":"9d4a3e4a0c2c6fde06ce396ab8a06879d2b75357a77b46206eb4fde1b1a92603"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:17.763887Z","signature_b64":"R4CwKvxaxYQCyR9bmHilw1Tjmma8LncSK60VIbOaChW413JfYfpyqNDKpkyTxnDvwqa35y0mOlDAiSTBkgYdBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c95681287c6fce1816021fc2ceb4a25f5de2d0fb7afcb04f23f94cc539e0ff9","last_reissued_at":"2026-05-17T23:41:17.763394Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:17.763394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dense induced bipartite subgraphs in triangle-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Matthew Kwan, Shoham Letzter, Tuan Tran","submitted_at":"2018-10-29T14:26:28Z","abstract_excerpt":"The problem of finding dense induced bipartite subgraphs in $H$-free graphs has a long history, and was posed 30 years ago by Erd\\H{o}s, Faudree, Pach and Spencer. In this paper, we obtain several results in this direction. First we prove that any $K_t$-free graph with minimum degree at least $d$ contains an induced bipartite subgraph of minimum degree at least $c_t \\log d/\\log \\log d$, confirming (asymptotically) several conjectures by Esperet, Kang and Thomass\\'e. Complementing this result, we further obtain optimal bounds for this problem in the case of dense triangle-free graphs, and we al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12144","kind":"arxiv","version":3},"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":"1810.12144","created_at":"2026-05-17T23:41:17.763472+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.12144v3","created_at":"2026-05-17T23:41:17.763472+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12144","created_at":"2026-05-17T23:41:17.763472+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSKWQEUHY36O","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSKWQEUHY36ODALA","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSKWQEUH","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/JSKWQEUHY36ODALAEH6CZ22KEX","json":"https://pith.science/pith/JSKWQEUHY36ODALAEH6CZ22KEX.json","graph_json":"https://pith.science/api/pith-number/JSKWQEUHY36ODALAEH6CZ22KEX/graph.json","events_json":"https://pith.science/api/pith-number/JSKWQEUHY36ODALAEH6CZ22KEX/events.json","paper":"https://pith.science/paper/JSKWQEUH"},"agent_actions":{"view_html":"https://pith.science/pith/JSKWQEUHY36ODALAEH6CZ22KEX","download_json":"https://pith.science/pith/JSKWQEUHY36ODALAEH6CZ22KEX.json","view_paper":"https://pith.science/paper/JSKWQEUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.12144&json=true","fetch_graph":"https://pith.science/api/pith-number/JSKWQEUHY36ODALAEH6CZ22KEX/graph.json","fetch_events":"https://pith.science/api/pith-number/JSKWQEUHY36ODALAEH6CZ22KEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSKWQEUHY36ODALAEH6CZ22KEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSKWQEUHY36ODALAEH6CZ22KEX/action/storage_attestation","attest_author":"https://pith.science/pith/JSKWQEUHY36ODALAEH6CZ22KEX/action/author_attestation","sign_citation":"https://pith.science/pith/JSKWQEUHY36ODALAEH6CZ22KEX/action/citation_signature","submit_replication":"https://pith.science/pith/JSKWQEUHY36ODALAEH6CZ22KEX/action/replication_record"}},"created_at":"2026-05-17T23:41:17.763472+00:00","updated_at":"2026-05-17T23:41:17.763472+00:00"}