{"schema_version":"source-reader-v1","record":{"source_id":"aim-caccetta","versions":[{"id":"aim-caccetta@2006-04-14-sha256-98251ac3","source_id":"aim-caccetta","title":"AIM · Caccetta–Häggkvist workshop survey","owner":"Blair D. Sullivan; hosted by American Institute of Mathematics","url":"https://aimath.org/WWN/caccetta/caccetta.pdf","subject_scope":"Directed graph questions and partial results from the 2006 workshop","revision":"2006-04-14-sha256-98251ac3","content_sha256":"98251ac3eb6b4078d06de1925f983338f9d2940557eb95c60f57bd05445e5b35","update_method":"Manual checked import; new observations require staff preview and publication","identifier_policy":"Canonical source URL plus explicit item/declaration locator; no fuzzy identity merge","observed_on":"2026-10-21","source_updated_on":"2006-04-14","rights":"metadata-link","license":"Not established; links and OpenMath paraphrases only","terms_url":"https://aimath.org/WWN/caccetta/caccetta.pdf","attribution":"Blair D. Sullivan; hosted by American Institute of Mathematics","rights_note":"Store metadata and original OpenMath paraphrases; follow the original source for authoritative wording.","check_interval_days":180}],"entries":[{"id":"caccetta-haggkvist:entry:0:v2","source_version_id":"aim-caccetta@2006-04-14-sha256-98251ac3","item_id":"Page 2, Conjecture 2.1","url":"https://aimath.org/WWN/caccetta/caccetta.pdf","wording":"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⌉?","wording_kind":"paraphrase","locator":"Page 2, Conjecture 2.1","supersedes":"caccetta-haggkvist:entry:0:v1"},{"id":"caccetta-haggkvist:entry:large-order:v2","source_version_id":"aim-caccetta@2006-04-14-sha256-98251ac3","item_id":"§5, Theorem 5.1","url":"https://aimath.org/WWN/caccetta/caccetta.pdf","wording":"Shen’s theorem gives the sharp ceiling bound when the vertex count is at least 2r² − 3r + 1.","wording_kind":"paraphrase","locator":"§5, Theorem 5.1","supersedes":"caccetta-haggkvist:entry:large-order:v1"},{"id":"caccetta-haggkvist:entry:small-degree:v2","source_version_id":"aim-caccetta@2006-04-14-sha256-98251ac3","item_id":"§2.1, Partial Results; references [5], [17], [19]","url":"https://aimath.org/WWN/caccetta/caccetta.pdf","wording":"The survey records the conjecture for out-degree parameters two through five, with separate proofs by Caccetta–Häggkvist (r = 2), Hamidoune (r = 3) and Hoàng–Reed (r = 4, 5).","wording_kind":"paraphrase","locator":"§2.1, Partial Results; references [5], [17], [19]","supersedes":"caccetta-haggkvist:entry:small-degree:v1"},{"id":"caccetta-haggkvist:entry:transitive:v2","source_version_id":"aim-caccetta@2006-04-14-sha256-98251ac3","item_id":"§2.1, vertex-transitive case","url":"https://aimath.org/WWN/caccetta/caccetta.pdf","wording":"Vertex-transitive directed graphs satisfy the cycle bound, by Hamidoune’s connectivity argument.","wording_kind":"paraphrase","locator":"§2.1, vertex-transitive case","supersedes":"caccetta-haggkvist:entry:transitive:v1"}],"problems":[{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11}],"selected_version_id":"aim-caccetta@2006-04-14-sha256-98251ac3","available_versions":[{"id":"aim-caccetta@2006-04-14-sha256-98251ac3","revision":"2006-04-14-sha256-98251ac3","observed_on":"2026-10-21","title":"AIM · Caccetta–Häggkvist workshop survey","publication":null,"content_sha256":"98251ac3eb6b4078d06de1925f983338f9d2940557eb95c60f57bd05445e5b35","used_in_current_publications":true},{"id":"aim-caccetta@2006-04-14","revision":"2006-04-14","observed_on":"2026-10-01","title":"AIM · Caccetta–Häggkvist workshop survey","publication":null,"content_sha256":null,"used_in_current_publications":false}],"usages":[{"id":"source-use-c0fbd714c3ca724c7577","entry_id":"caccetta-haggkvist:entry:0:v2","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"definition","title":"Minimum out-degree","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-9ce0c29fb69fb9e10f14","entry_id":"caccetta-haggkvist:entry:0:v2","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"milestone","title":"The cycle bound is proposed","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-caa503e5041a2fd94cf8","entry_id":"caccetta-haggkvist:entry:0:v2","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"question","title":"Caccetta–Häggkvist cycle bound","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-7b0cf3b7a5f9a3edec31","entry_id":"caccetta-haggkvist:entry:0:v2","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"reading","title":"Consult the original question and its hypotheses.","claim":null,"fragment":"provenance","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-ce66e9e95e8bfae6a06f","entry_id":"caccetta-haggkvist:entry:0:v2","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"statement","title":"The full directed cycle bound","claim":{"id":"claim-ch-cycle-bound","version":2,"slug":"ch-cycle-bound","title":"The full directed cycle bound"},"fragment":"claim-ch-cycle-bound","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-9be67dda775583a215cd","entry_id":"caccetta-haggkvist:entry:large-order:v2","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"assessment","title":"Established result in cited source","claim":{"id":"claim-ch-large-order","version":2,"slug":"ch-large-order","title":"The sharp bound when n ≥ 2r² − 3r + 1"},"fragment":"claim-ch-large-order","assessment":{"id":"caccetta-haggkvist:report:ch-large-order:v2","entry_id":"caccetta-haggkvist:entry:large-order:v2","state":"resolved","source_label":"Established result in cited source","scope":"Shen’s theorem restricts the order relative to the minimum-degree parameter.","source_date":null,"observed_on":"2026-10-21","evidence_url":"https://aimath.org/WWN/caccetta/caccetta.pdf","supersedes":"caccetta-haggkvist:report:ch-large-order:v1"},"superseded":false,"formalization":null,"update":null},{"id":"source-use-98a72ab6868fe1e66db5","entry_id":"caccetta-haggkvist:entry:large-order:v2","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"milestone","title":"A theorem for sufficiently large order","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-30dcec915949308f65d1","entry_id":"caccetta-haggkvist:entry:large-order:v2","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"question","title":"Caccetta–Häggkvist cycle bound","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-cc672c94a8411209062a","entry_id":"caccetta-haggkvist:entry:large-order:v2","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"statement","title":"The sharp bound when n ≥ 2r² − 3r + 1","claim":{"id":"claim-ch-large-order","version":2,"slug":"ch-large-order","title":"The sharp bound when n ≥ 2r² − 3r + 1"},"fragment":"claim-ch-large-order","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-63bb0ab260f08449c229","entry_id":"caccetta-haggkvist:entry:small-degree:v2","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"assessment","title":"Established result in cited source","claim":{"id":"claim-ch-small-outdegree","version":2,"slug":"ch-small-outdegree","title":"The sharp bound for out-degree two through five"},"fragment":"claim-ch-small-outdegree","assessment":{"id":"caccetta-haggkvist:report:ch-small-outdegree:v2","entry_id":"caccetta-haggkvist:entry:small-degree:v2","state":"resolved","source_label":"Established result in cited source","scope":"The degree parameter is restricted to two through five; the graph need not be regular.","source_date":null,"observed_on":"2026-10-21","evidence_url":"https://aimath.org/WWN/caccetta/caccetta.pdf","supersedes":"caccetta-haggkvist:report:ch-small-outdegree:v1"},"superseded":false,"formalization":null,"update":null},{"id":"source-use-2fef2686dce0ace0f36c","entry_id":"caccetta-haggkvist:entry:small-degree:v2","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"milestone","title":"Small degree cases are established","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-e0b556a750a023f0d545","entry_id":"caccetta-haggkvist:entry:small-degree:v2","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"question","title":"Caccetta–Häggkvist cycle bound","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-bbe9090614218e6826a7","entry_id":"caccetta-haggkvist:entry:small-degree:v2","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"statement","title":"The sharp bound for out-degree two through five","claim":{"id":"claim-ch-small-outdegree","version":2,"slug":"ch-small-outdegree","title":"The sharp bound for out-degree two through five"},"fragment":"claim-ch-small-outdegree","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-a88fd769d908e060146d","entry_id":"caccetta-haggkvist:entry:transitive:v2","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"assessment","title":"Established result in cited source","claim":{"id":"claim-ch-vertex-transitive","version":2,"slug":"ch-vertex-transitive","title":"The sharp bound for vertex-transitive graphs"},"fragment":"claim-ch-vertex-transitive","assessment":{"id":"caccetta-haggkvist:report:ch-vertex-transitive:v2","entry_id":"caccetta-haggkvist:entry:transitive:v2","state":"resolved","source_label":"Established result in cited source","scope":"Vertex-transitivity requires the automorphism group to act transitively on vertices.","source_date":null,"observed_on":"2026-10-21","evidence_url":"https://aimath.org/WWN/caccetta/caccetta.pdf","supersedes":"caccetta-haggkvist:report:ch-vertex-transitive:v1"},"superseded":false,"formalization":null,"update":null},{"id":"source-use-f5e5793daa38dd8ce34a","entry_id":"caccetta-haggkvist:entry:transitive:v2","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"milestone","title":"The vertex-transitive case","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-69c1d70f9a48e22764cc","entry_id":"caccetta-haggkvist:entry:transitive:v2","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"question","title":"Caccetta–Häggkvist cycle bound","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-03480b7efa7544a2126e","entry_id":"caccetta-haggkvist:entry:transitive:v2","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"statement","title":"The sharp bound for vertex-transitive graphs","claim":{"id":"claim-ch-vertex-transitive","version":2,"slug":"ch-vertex-transitive","title":"The sharp bound for vertex-transitive graphs"},"fragment":"claim-ch-vertex-transitive","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[],"linked_sources":[]}}