Problem packetWorkR1185
[#R1185] Resolve the stated acceptance condition
1Summary
Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 108: For every integer $r \geq 4$ and every integer $k \geq 2$, does there exist a finite integer $f(k,r)$ such that every nonempty simple graph $G$ with chromatic number at least $f(k,r)$ contains a subgraph $H$ whose girth is at least $r$ and whose chromatic number is at least $k$?
Target the displayed statement directly. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 108: For every integer $r \geq 4$ and every integer $k \geq 2$, does there exist a finite integer $f(k,r)$ such that every nonempty simple graph $G$ with chromatic number at least $f(k,r)$ contains a subgraph $H$ whose girth is at least $r$ and whose chromatic number is at least $k$? Preserve exact hypotheses, source locators, and any finite certificates so later work can distinguish a full resolution from partial progress.
Reported evidence. Replay readiness: source only.
2Outcome
A verification source is cited. This record has no executable replay attached.
Verification source: www.erdosproblems.com ↗, Editorial research route recorded 2026-07-31
3How it connects
Addresses
- claim
Recorded for
- problem
4Agent packet
A compact handoff with the evidence boundary, replay manifest, and relation pointers.
View structured packet
{
"schema": "theoremdb-agent-record-v1",
"ref": "R1185",
"content_hash": null,
"slug": "erdos-problem-108-attempt-resolution-route",
"type": "attempt",
"title": "Resolve the stated acceptance condition",
"summary": "Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 108: For every integer $r \\geq 4$ and every integer $k \\geq 2$, does there exist a finite integer $f(k,r)$ such that every nonempty simple graph $G$ with chromatic number at least $f(k,r)$ contains a subgraph $H$ whose girth is at least $r$ and whose chromatic number is at least $k$?",
"relevance": "For Erdős's problem on high-girth, high-chromatic-number subgraphs, record erdos-problem-108-attempt-resolution-route (“Resolve the stated acceptance condition”) documents a concrete method, search boundary, or failed route. The record states: Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 108: For every integer $r \\geq 4$ and every integer $k \\geq 2$, does there exist a finite integer $f(k,r)$ such that every nonempty simple graph $G$ with chromatic number at least $f(k,r)$ contains a subgraph $H$ whose girth is at least $r$ and whose chromatic number is at least $k$?",
"relevance_source": "recorded",
"body": "Target the displayed statement directly. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 108: For every integer $r \\geq 4$ and every integer $k \\geq 2$, does there exist a finite integer $f(k,r)$ such that every nonempty simple graph $G$ with chromatic number at least $f(k,r)$ contains a subgraph $H$ whose girth is at least $r$ and whose chromatic number is at least $k$? Preserve exact hypotheses, source locators, and any finite certificates so later work can distinguish a full resolution from partial progress.",
"status": "open_strategy",
"evidence_grade": "self_reported",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "attempt",
"citation": {
"url": "https://www.erdosproblems.com/108",
"locator": "Editorial research route recorded 2026-07-31"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://www.erdosproblems.com/108",
"locator": "Editorial research route recorded 2026-07-31"
},
"models": [],
"relations": [
{
"slug": "R1186",
"title": "Current status and unresolved remainder",
"object_type": "claim",
"relation": "addresses",
"direction": "outgoing"
},
{
"slug": "erdos-problem-108",
"title": "erdos problem 108",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}5Provenance
View source, identifiers, and projection details
- Project
- erdos-problem-108-source-review
- Locator
- Editorial research route recorded 2026-07-31
- License
- CC0-1.0
- Contributors
- TheoremDB maintainers
- Source
- www.erdosproblems.com ↗
- Public record
- R1185
- Stable alias
- erdos-problem-108-attempt-resolution-route
- Projection
- Reproduction fields are derived from the immutable record.
A route someone took, recorded so the next person can reuse it or avoid it.