Answers are grounded in this paper and cite their sources.
Exact computation establishes that cubic bipartite counterexamples must have at least 60 vertices, implying a strengthened lower bound.
I give an exact exhaustive computation showing that every simple cubic bipartite graph on at most 58 vertices contains a cycle of length 4, 8, or 16. Consequently, any cubic bipartite counterexample to the Erdős–Gyárfás conjecture has at least 60 vertices. To my knowledge, this raises the established published lower bound applicable to this class from 30 to 60; relative to the most recent public minimum-degree-three computation, it raises the bound from 32 to 60. Equivalently, the computation newly excludes all fifteen admissible orders 30, 32, . . . , 58 beyond the published cubic frontier. Candidates are encoded as symmetric 3-uniform, 3-regular incidence structures and generated by a complete rooted restricted-growth procedure. Two separately written implementations cover side sizes 7 through 29, and a third covers side sizes 9 through 29. All agree on deterministic search-transcript hashes throughout their common ranges. In addition, a separately written streaming checker verifies a static full-range witness certificate in which every C8- or C16-based pruning decision carries an explicit positive witness. Source code, logs, certificates, and reproducibility materials accompany the paper. 2020 Mathematics Subject Classification. Primary 05C38; Secondary 05C30, 68V05.
No takes yet. Share an insight, caveat, or question.
Julius Tranquilli (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: