Aharoni-Korman conjecture
The Aharoni-Korman conjecture, also known as the fish-bone conjecture, was a proposed statement in combinatorics and graph theory concerning matchings in bipartite graphs under degree constraints.
Description
Initially conjectured by Ron Aharoni and his student Vladimir Korman, the conjecture was widely believed to be true, with many attempting to prove its correctness since its inception. However, in November 2024, the conjecture was disproven by Lawrence Hollom, a mathematician and googologist at the University of Cambridge, who provided a counterexample that demonstrated its failure under certain conditions.
Formulation
A subset of a partially ordered set, or poset, , is a chain if the elements of are pairwise comparable, and it is an antichain if its elements are pairwise incomparable. If has no infinite antichain, then we say that it satisfies the finite antichain condition.
In 1992, Aharoni and Korman posed the following conjecture:
If a poset contains no infinite antichain then, for every positive integer , there exist chains and a partition of into disjoint antichains such that each meets chains .
For example, if is the poset on the set with ordering given by setting if and only if and , then the case of the conjecture holds by taking for all integers .
Disproof
Lawrence Hollom disproved this conjecture in his paper titled "A Resolution of the Aharoni-Korman Conjecture".[1] Its disproof was also discussed in great length on Trefor Bazett's YouTube channel.[2]
References
- ↑ Hollom, Lawrence (2024). "A resolution of the Aharoni-Korman conjecture". arXiv:2411.16844 [math.CO].
- ↑ Dr. Trefor Bazett (2024-12-11). Math News: The Fish Bone Conjecture has been deboned!!. Retrieved 2024-12-13 – via YouTube.
This article "Aharoni-Korman conjecture" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Aharoni-Korman conjecture. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.
