{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:POK6K7OSTEKL6RJF3CGDEBB52P","short_pith_number":"pith:POK6K7OS","schema_version":"1.0","canonical_sha256":"7b95e57dd29914bf4525d88c32043dd3f0dde08fb4a8a78fc6571e5a4221c0e0","source":{"kind":"arxiv","id":"0902.1608","version":1},"attestation_state":"computed","paper":{"title":"A note on edge-colourings avoiding rainbow K_4 and monochromatic K_m","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Kral, Tomas Kaiser, Veselin Jungic","submitted_at":"2009-02-10T09:11:53Z","abstract_excerpt":"We study the mixed Ramsey number maxR(n,K_m,K_r), defined as the maximum number of colours in an edge-colouring of the complete graph K_n, such that K_n has no monochromatic complete subgraph on m vertices and no rainbow complete subgraph on r vertices. Improving an upper bound of Axenovich and Iverson, we show that maxR(n,K_m,K_4) <= n^{3/2}\\sqrt{2m} for all m >= 3. Further, we discuss a possible way to improve their lower bound on maxR(n,K_4,K_4) based on incidence graphs of finite projective planes."},"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":"0902.1608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-02-10T09:11:53Z","cross_cats_sorted":[],"title_canon_sha256":"4361b07468b74ecc7a6ad96ed475aafeaff6c7bfb6095913bf70de7714518c35","abstract_canon_sha256":"cdcbe4c42112baeb0d513c97c604d766dc67e62e085014897f361f8c29732fe2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:45.415205Z","signature_b64":"G8LsMXzt3zMpdhzmbQWKyldZVW+nA3C3XjsknfLEjXIx8BwnzlCnWpkAEN+qc05qvfiu+K6FxMJv+hr5q7w3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b95e57dd29914bf4525d88c32043dd3f0dde08fb4a8a78fc6571e5a4221c0e0","last_reissued_at":"2026-05-18T04:40:45.414516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:45.414516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on edge-colourings avoiding rainbow K_4 and monochromatic K_m","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Kral, Tomas Kaiser, Veselin Jungic","submitted_at":"2009-02-10T09:11:53Z","abstract_excerpt":"We study the mixed Ramsey number maxR(n,K_m,K_r), defined as the maximum number of colours in an edge-colouring of the complete graph K_n, such that K_n has no monochromatic complete subgraph on m vertices and no rainbow complete subgraph on r vertices. Improving an upper bound of Axenovich and Iverson, we show that maxR(n,K_m,K_4) <= n^{3/2}\\sqrt{2m} for all m >= 3. Further, we discuss a possible way to improve their lower bound on maxR(n,K_4,K_4) based on incidence graphs of finite projective planes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.1608","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":"0902.1608","created_at":"2026-05-18T04:40:45.414619+00:00"},{"alias_kind":"arxiv_version","alias_value":"0902.1608v1","created_at":"2026-05-18T04:40:45.414619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.1608","created_at":"2026-05-18T04:40:45.414619+00:00"},{"alias_kind":"pith_short_12","alias_value":"POK6K7OSTEKL","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"POK6K7OSTEKL6RJF","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"POK6K7OS","created_at":"2026-05-18T12:26:01.383474+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/POK6K7OSTEKL6RJF3CGDEBB52P","json":"https://pith.science/pith/POK6K7OSTEKL6RJF3CGDEBB52P.json","graph_json":"https://pith.science/api/pith-number/POK6K7OSTEKL6RJF3CGDEBB52P/graph.json","events_json":"https://pith.science/api/pith-number/POK6K7OSTEKL6RJF3CGDEBB52P/events.json","paper":"https://pith.science/paper/POK6K7OS"},"agent_actions":{"view_html":"https://pith.science/pith/POK6K7OSTEKL6RJF3CGDEBB52P","download_json":"https://pith.science/pith/POK6K7OSTEKL6RJF3CGDEBB52P.json","view_paper":"https://pith.science/paper/POK6K7OS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0902.1608&json=true","fetch_graph":"https://pith.science/api/pith-number/POK6K7OSTEKL6RJF3CGDEBB52P/graph.json","fetch_events":"https://pith.science/api/pith-number/POK6K7OSTEKL6RJF3CGDEBB52P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/POK6K7OSTEKL6RJF3CGDEBB52P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/POK6K7OSTEKL6RJF3CGDEBB52P/action/storage_attestation","attest_author":"https://pith.science/pith/POK6K7OSTEKL6RJF3CGDEBB52P/action/author_attestation","sign_citation":"https://pith.science/pith/POK6K7OSTEKL6RJF3CGDEBB52P/action/citation_signature","submit_replication":"https://pith.science/pith/POK6K7OSTEKL6RJF3CGDEBB52P/action/replication_record"}},"created_at":"2026-05-18T04:40:45.414619+00:00","updated_at":"2026-05-18T04:40:45.414619+00:00"}