{"schema_version":"source-reader-v1","record":{"source_id":"aim-caccetta","versions":[{"id":"aim-caccetta@2006-04-14","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","content_sha256":null,"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-01","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:v1","source_version_id":"aim-caccetta@2006-04-14","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":null},{"id":"caccetta-haggkvist:entry:large-order:v1","source_version_id":"aim-caccetta@2006-04-14","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":null},{"id":"caccetta-haggkvist:entry:small-degree:v1","source_version_id":"aim-caccetta@2006-04-14","item_id":"§2.1, known cases; references [8], [22], [25]","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, Hamidoune and Hoang–Reed.","wording_kind":"paraphrase","locator":"§2.1, known cases; references [8], [22], [25]","supersedes":null},{"id":"caccetta-haggkvist:entry:transitive:v1","source_version_id":"aim-caccetta@2006-04-14","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":null}],"problems":[{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":9}],"selected_version_id":"aim-caccetta@2006-04-14","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-ad3251763601b72fa64e","entry_id":"caccetta-haggkvist:entry:0:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":9},"kind":"assessment","title":"Conjecture 2.1; no current-status report","claim":null,"fragment":"research-state","assessment":{"id":"caccetta-haggkvist:report:0:v1","entry_id":"caccetta-haggkvist:entry:0:v1","state":"unknown","source_label":"Conjecture 2.1; no current-status report","scope":"The cited source item and version only; this is not an independent OpenMath assessment.","source_date":"2006-04-14","observed_on":"2026-10-01","evidence_url":"https://aimath.org/WWN/caccetta/caccetta.pdf","supersedes":null},"superseded":true,"formalization":null,"update":null},{"id":"source-use-4921ef088f0d7b3a7891","entry_id":"caccetta-haggkvist:entry:0:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":9},"kind":"definition","title":"Minimum out-degree","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-bf2c6f0e23d0f08cc92e","entry_id":"caccetta-haggkvist:entry:0:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":9},"kind":"milestone","title":"The cycle bound is proposed","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-d7dd88affc08bd11563f","entry_id":"caccetta-haggkvist:entry:0:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":9},"kind":"question","title":"Caccetta–Häggkvist cycle bound","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-dfcdb03c7aa4b1b63061","entry_id":"caccetta-haggkvist:entry:0:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":9},"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-773a0165641092c00649","entry_id":"caccetta-haggkvist:entry:0:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":9},"kind":"statement","title":"The full directed cycle bound","claim":{"id":"claim-ch-cycle-bound","version":1,"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-d98c0cd4a5cc7297d904","entry_id":"caccetta-haggkvist:entry:large-order:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":9},"kind":"assessment","title":"Established result in cited source","claim":{"id":"claim-ch-large-order","version":1,"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:v1","entry_id":"caccetta-haggkvist:entry:large-order:v1","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-12","evidence_url":"https://aimath.org/WWN/caccetta/caccetta.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-7bbeb36994be83589567","entry_id":"caccetta-haggkvist:entry:large-order:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":9},"kind":"milestone","title":"A theorem for sufficiently large order","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-48729741f5c5bb1b8e74","entry_id":"caccetta-haggkvist:entry:large-order:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":9},"kind":"question","title":"Caccetta–Häggkvist cycle bound","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-6d94a7bf1a1975725c32","entry_id":"caccetta-haggkvist:entry:large-order:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":9},"kind":"statement","title":"The sharp bound when n ≥ 2r² − 3r + 1","claim":{"id":"claim-ch-large-order","version":1,"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-bc20ed1f26ac7389e45a","entry_id":"caccetta-haggkvist:entry:small-degree:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":9},"kind":"assessment","title":"Established result in cited source","claim":{"id":"claim-ch-small-outdegree","version":1,"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:v1","entry_id":"caccetta-haggkvist:entry:small-degree:v1","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-12","evidence_url":"https://aimath.org/WWN/caccetta/caccetta.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-ca1d9d3edc47e0eeb5a9","entry_id":"caccetta-haggkvist:entry:small-degree:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":9},"kind":"milestone","title":"Small degree cases are established","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-31abc0cd917cc84a24e4","entry_id":"caccetta-haggkvist:entry:small-degree:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":9},"kind":"question","title":"Caccetta–Häggkvist cycle bound","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-9f5e722d1e57b3b82bbb","entry_id":"caccetta-haggkvist:entry:small-degree:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":9},"kind":"statement","title":"The sharp bound for out-degree two through five","claim":{"id":"claim-ch-small-outdegree","version":1,"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-133871e02f9baeb451df","entry_id":"caccetta-haggkvist:entry:transitive:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":9},"kind":"assessment","title":"Established result in cited source","claim":{"id":"claim-ch-vertex-transitive","version":1,"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:v1","entry_id":"caccetta-haggkvist:entry:transitive:v1","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-12","evidence_url":"https://aimath.org/WWN/caccetta/caccetta.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-cc8b0e11b9f5505063a3","entry_id":"caccetta-haggkvist:entry:transitive:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":9},"kind":"milestone","title":"The vertex-transitive case","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-33ee1c2cbc37f381bc45","entry_id":"caccetta-haggkvist:entry:transitive:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":9},"kind":"question","title":"Caccetta–Häggkvist cycle bound","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-1c140d8b4163dcac4388","entry_id":"caccetta-haggkvist:entry:transitive:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":9},"kind":"statement","title":"The sharp bound for vertex-transitive graphs","claim":{"id":"claim-ch-vertex-transitive","version":1,"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":[]}}