{
  "family_id": "184",
  "title": "Correspondence coloring with a fixed forbidden subgraph",
  "discipline": "Combinatorics",
  "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
  "papers": [
    {
      "title": "Correspondence coloring graphs with a forbidden clique",
      "path": "preprints/Correspondence-Coloring-Graphs-with-a-Forbidden-Clique-October-5-2026/correspondence-coloring-forbidden-clique.pdf",
      "url": "https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/Correspondence-Coloring-Graphs-with-a-Forbidden-Clique-October-5-2026/correspondence-coloring-forbidden-clique.pdf",
      "readme_path": "preprints/Correspondence-Coloring-Graphs-with-a-Forbidden-Clique-October-5-2026/README.md",
      "tex_paths": [],
      "pdf_exists": true
    },
    {
      "title": "A logarithmic independence bound for clique-free graphs",
      "path": "preprints/A-Logarithmic-Independence-Bound-for-Clique-Free-Graphs-September-25-2026/paper.pdf",
      "url": "https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/A-Logarithmic-Independence-Bound-for-Clique-Free-Graphs-September-25-2026/paper.pdf",
      "readme_path": "preprints/A-Logarithmic-Independence-Bound-for-Clique-Free-Graphs-September-25-2026/README.md",
      "tex_paths": [],
      "pdf_exists": true
    }
  ],
  "lean_scope_path": "lean/docs/184.md",
  "lean_scope_url": "https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/lean/docs/184.md",
  "verification_status": "scope_document_available_not_independently_verified",
  "review_status": "inventory_complete_deep_review_pending"
}