AIM · Caccetta–Häggkvist workshop survey
Not assessedSource label: Conjecture 2.1; no current-status report
Source dated Apr 14, 2006 · Observed Oct 1, 2026
The cited source item and version only; this is not an independent OpenMath assessment.
Combinatorics MSC2020 05C20 / 05C38
QuestionCaccetta–Häggkvist cycle bound
Current status unknownScope unassessed
Resolution scope has not been assessed in this publication.
Source report · observed Oct 1, 2026
Viewing pinned publication v1. View the current publication →
Question & scope
Must a simple directed graph with n vertices and minimum out-degree at least r ≥ 1 contain a directed cycle of length at most ⌈n/r⌉?
Finite simple directed graphs. This historical survey is a discovery source; the present research state has not been assessed.
Question paraphrased by OpenMath. Use the cited source and locator for authoritative wording.
Research state
Current status unknownScope unassessed
Resolution scope has not been assessed in this publication.
Source report · observed Oct 1, 2026 · AIM · Caccetta–Häggkvist workshop survey
This is a discovery entry. OpenMath has checked the linked source and attribution; it has not independently assessed the present mathematical status.
This report comes from a historical source. A recent observation of the document does not establish a current research status.
Literature & sources
2006 workshop survey ↗
Blair D. Sullivan, 14 April 2006, Conjecture 2.1 on page 2. Only a paraphrase and source link are published.
Provenance & coverage
Published after staff preview and source checks. This page covers the cited items; it does not represent a complete list of problems or a literature-wide review.
- No exhaustive literature or source-list coverage.
- Independent mathematical assessment has not been performed.
- Historical source from 2006; recent progress and present status are unreviewed.
AIM · Caccetta–Häggkvist workshop survey ↗
Blair D. Sullivan; hosted by American Institute of Mathematics · metadata-link · Not established; links and OpenMath paraphrases only
Store metadata and original OpenMath paraphrases; follow the original source for authoritative wording. Rights / source terms
1 cited entry · exact source identity
- Version
- aim-caccetta@2006-04-14
- Revision
- 2006-04-14
- Content SHA-256
- No upstream byte snapshot retained; linked metadata only
- Source update
- 2006-04-14
- Observed
- 2026-10-01
- Check cadence
- 180 days
- Page 2, Conjecture 2.1 ↗
caccetta-haggkvist:entry:0:v1
Publication v1 · history & checksums
- Stable Problem ID
- problem-caccetta-haggkvist
- Publication SHA-256
- db6e70f520a272c5e41be7c19107a8324059d456e2366daf2156d73d547ab7c7
- Published
- 2026-09-30T20:13:42.267521+00:00
- Publication reason
- Initial checked pilot publication; source attribution, rights, wording and coverage reviewed by OpenMath staff.
- v1 · publish · Sep 30, 2026
Initial checked pilot publication; source attribution, rights, wording and coverage reviewed by OpenMath staff.
- v2 · publish · Oct 10, 2026
Add cited resolution scope and consolidate equivalent prime formulations and supporting Claims; mathematical evidence and execution review remain distinct.
- v3 · publish · Oct 11, 2026
Publish checked pilot curation with canonical Claims and scoped progress; preserve exact source revisions, assumptions, coverage limits and historical publications. External artifacts and OpenMath execution remain distinct.
- v4 · publish · Oct 12, 2026
Reviewed reader correction: preserve assertion history, exact citations and scoped assessments; task evidence names its exact Claim target.
- v5 · publish · Oct 12, 2026
Reviewed reader correction: preserve assertion history, exact citations and scoped assessments; task evidence names its exact Claim target.
- v6 · publish · Oct 13, 2026
Reviewed reader correction: preserve assertion history, exact citations and scoped assessments; task evidence names its exact Claim target.
- v7 · publish · Oct 13, 2026
Reviewed reader correction: preserve assertion history, exact citations and scoped assessments; task evidence names its exact Claim target.
- v8 · publish · Oct 15, 2026
Reviewed reader correction: preserve assertion history, exact citations and scoped assessments; task evidence names its exact Claim target.
- v9 · publish · Oct 20, 2026
Reviewed reader correction: preserve assertion history, exact citations and scoped assessments; task evidence names its exact Claim target.
- v10 · publish · Oct 21, 2026
Reviewed reader correction: preserve assertion history, exact citations and scoped assessments; task evidence names its exact Claim target.
- v11 · publish · Oct 21, 2026
Reviewed reader correction: preserve assertion history, exact citations and scoped assessments; task evidence names its exact Claim target.