---

Claim. Every bipartite graph with minimum degree at least $3$ on fewer than $32$ vertices contains a cycle whose length is a power of $2$, so a bipartite counterexample to the conjecture of Problem 64 has at least $32$ vertices. The result is P. Salehi Nowbandegani and H. Esfandiari, An experimental result on the Erdős-Gyárfás conjecture in bipartite graphs, presented at the 14th Workshop on Graph Theory (CID), Szklarska Poręba, 18–23 September 2011; the page name carries the workshop's first day, since no source gives the day of the presentation. The statement and the venue are those of the introduction and reference [6] of the final arXiv version (v3, 7 February 2013) of the claw-free paper of Salehi Nowbandegani, Esfandiari, Shirdareh Haghighi and Bibak (claim page), which says the two authors prove that any bipartite counterexample must have at least $32$ vertices; the thread comment of 6 December 2025 that the site's remark points to lists the bound among the known results, through a ResearchGate record that is access-controlled. No text of the result beyond these citations is known to this corpus, and the title's word "experimental" marks it as a computation. Read depth: the citing paper's introduction and references.

Covers. The statement of Problem 64 for bipartite graphs on at most $31$ vertices. Tranquilli's search (claim page) reaches $58$ vertices for the cubic bipartite graphs only.

Depends on. No page of this wiki.

Standing. Claimed: a workshop presentation known only through citations, with no published text, certificate or outside review known to this corpus. The site's curator cites the family list that names the result while labeling the problem FALSIFIABLE, which is commentary on an open problem and not acceptance.