{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EMHBSVU2NJCOGKIGDJRSWEM47F","short_pith_number":"pith:EMHBSVU2","schema_version":"1.0","canonical_sha256":"230e19569a6a44e329061a632b119cf94261ffcf3ac2ac9292e64e2d615d691f","source":{"kind":"arxiv","id":"1708.02264","version":1},"attestation_state":"computed","paper":{"title":"On the clique number of the square of a line graph and its relation to Ore-degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luke Postle, Maxime Faron","submitted_at":"2017-08-07T18:50:27Z","abstract_excerpt":"In 1985, Erd\\H{o}s and Ne\\v{s}et\\v{r}il conjectured that the square of the line graph of a graph $G$, that is $L(G)^2$, can be colored with $\\frac{5}{4}\\Delta(G)^2$ colors. This conjecture implies the weaker conjecture that the clique number of such a graph, that is $\\omega(L(G)^2)$, is at most $\\frac{5}{4}\\Delta(G)^2$. In 2015, \\'Sleszy\\'nska-Nowak proved that $\\omega(L(G)^2)\\le \\frac{3}{2}\\Delta(G)^2$. In this paper, we prove that $\\omega(L(G)^2)\\le \\frac{4}{3}\\Delta(G)^2$. This theorem follows from our stronger result that $\\omega(L(G)^2)\\le \\frac{\\sigma(G)^2}{3}$ where $\\sigma(G) := \\max_{"},"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":"1708.02264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-07T18:50:27Z","cross_cats_sorted":[],"title_canon_sha256":"1c32cdbaac4eefa1f2c3fd9ea553c4d6b85e29221793b0dd20dd619a6937d29d","abstract_canon_sha256":"a1cd860677a018f1d6c4d1e666475672218238f7c5311b232d385a3f9cbd24a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:24.949374Z","signature_b64":"0sZwK0ojKXmtcPFRhPt63EPWvjmQR5kveeaY1HtNFT1CejChuQdf9elLt3BYj/ZilONRv5YSpMnp0hxy9SOsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"230e19569a6a44e329061a632b119cf94261ffcf3ac2ac9292e64e2d615d691f","last_reissued_at":"2026-05-18T00:38:24.948763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:24.948763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the clique number of the square of a line graph and its relation to Ore-degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luke Postle, Maxime Faron","submitted_at":"2017-08-07T18:50:27Z","abstract_excerpt":"In 1985, Erd\\H{o}s and Ne\\v{s}et\\v{r}il conjectured that the square of the line graph of a graph $G$, that is $L(G)^2$, can be colored with $\\frac{5}{4}\\Delta(G)^2$ colors. This conjecture implies the weaker conjecture that the clique number of such a graph, that is $\\omega(L(G)^2)$, is at most $\\frac{5}{4}\\Delta(G)^2$. In 2015, \\'Sleszy\\'nska-Nowak proved that $\\omega(L(G)^2)\\le \\frac{3}{2}\\Delta(G)^2$. In this paper, we prove that $\\omega(L(G)^2)\\le \\frac{4}{3}\\Delta(G)^2$. This theorem follows from our stronger result that $\\omega(L(G)^2)\\le \\frac{\\sigma(G)^2}{3}$ where $\\sigma(G) := \\max_{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02264","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":"1708.02264","created_at":"2026-05-18T00:38:24.948837+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.02264v1","created_at":"2026-05-18T00:38:24.948837+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02264","created_at":"2026-05-18T00:38:24.948837+00:00"},{"alias_kind":"pith_short_12","alias_value":"EMHBSVU2NJCO","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EMHBSVU2NJCOGKIG","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EMHBSVU2","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2210.05915","citing_title":"Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)","ref_index":80,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EMHBSVU2NJCOGKIGDJRSWEM47F","json":"https://pith.science/pith/EMHBSVU2NJCOGKIGDJRSWEM47F.json","graph_json":"https://pith.science/api/pith-number/EMHBSVU2NJCOGKIGDJRSWEM47F/graph.json","events_json":"https://pith.science/api/pith-number/EMHBSVU2NJCOGKIGDJRSWEM47F/events.json","paper":"https://pith.science/paper/EMHBSVU2"},"agent_actions":{"view_html":"https://pith.science/pith/EMHBSVU2NJCOGKIGDJRSWEM47F","download_json":"https://pith.science/pith/EMHBSVU2NJCOGKIGDJRSWEM47F.json","view_paper":"https://pith.science/paper/EMHBSVU2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.02264&json=true","fetch_graph":"https://pith.science/api/pith-number/EMHBSVU2NJCOGKIGDJRSWEM47F/graph.json","fetch_events":"https://pith.science/api/pith-number/EMHBSVU2NJCOGKIGDJRSWEM47F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EMHBSVU2NJCOGKIGDJRSWEM47F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EMHBSVU2NJCOGKIGDJRSWEM47F/action/storage_attestation","attest_author":"https://pith.science/pith/EMHBSVU2NJCOGKIGDJRSWEM47F/action/author_attestation","sign_citation":"https://pith.science/pith/EMHBSVU2NJCOGKIGDJRSWEM47F/action/citation_signature","submit_replication":"https://pith.science/pith/EMHBSVU2NJCOGKIGDJRSWEM47F/action/replication_record"}},"created_at":"2026-05-18T00:38:24.948837+00:00","updated_at":"2026-05-18T00:38:24.948837+00:00"}