Misplaced Pages

Draft:Aharoni-Korman conjecture: Difference between revisions

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Browse history interactivelyNext edit →Content deleted Content addedVisualWikitext
Revision as of 09:13, 13 December 2024 editRoblewi (talk | contribs)14 edits Created a new page on the Aharoni-Korman conjecture! :)Tags: Visual edit Disambiguation links added  Revision as of 10:10, 13 December 2024 edit undoXegma (talk | contribs)Extended confirmed users, New page reviewers7,669 edits Added tags to the page using Page Curation (orphan, uncategorised)Tag: PageTriageNext edit →
Line 1: Line 1:
{{orphan|date=December 2024}}
The '''Aharoni-Korman conjecture''', also known as the '''fish-bone conjecture''', was a proposed statement in ] and ] concerning ] in ] under degree constraints. Initially conjectured by ] 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 ] and ] at the ], who provided a ] that demonstrated its failure under certain conditions. The '''Aharoni-Korman conjecture''', also known as the '''fish-bone conjecture''', was a proposed statement in ] and ] concerning ] in ] under degree constraints. Initially conjectured by ] 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 ] and ] at the ], who provided a ] that demonstrated its failure under certain conditions.


Line 12: Line 13:
=== Disproof === === Disproof ===
Lawrence Hollom disproved this conjecture in his paper titled "A Resolution of the Aharoni-Korman Conjecture"<ref>{{Cite web |title=Search {{!}} arXiv e-print repository |url=https://arxiv.org/search/math?query=a+resolution+of+the+aharoni-korman+conjecture&searchtype=all&abstracts=show&order=-announced_date_first&size=50 |access-date=2024-12-13 |website=arxiv.org |language=en}}</ref>. Its disproof was also discussed in great length on Trefor Bazett's ] channel<ref>{{Cite AV media |url=https://www.youtube.com/watch?si=yrn8swmqUbAbNzFV&v=YQnEB5rio_A&feature=youtu.be |title=Math News: The Fish Bone Conjecture has been deboned!! |date=2024-12-11 |last=Dr. Trefor Bazett |access-date=2024-12-13 |via=YouTube}}</ref>. Lawrence Hollom disproved this conjecture in his paper titled "A Resolution of the Aharoni-Korman Conjecture"<ref>{{Cite web |title=Search {{!}} arXiv e-print repository |url=https://arxiv.org/search/math?query=a+resolution+of+the+aharoni-korman+conjecture&searchtype=all&abstracts=show&order=-announced_date_first&size=50 |access-date=2024-12-13 |website=arxiv.org |language=en}}</ref>. Its disproof was also discussed in great length on Trefor Bazett's ] channel<ref>{{Cite AV media |url=https://www.youtube.com/watch?si=yrn8swmqUbAbNzFV&v=YQnEB5rio_A&feature=youtu.be |title=Math News: The Fish Bone Conjecture has been deboned!! |date=2024-12-11 |last=Dr. Trefor Bazett |access-date=2024-12-13 |via=YouTube}}</ref>.
{{uncategorised|date=December 2024}}

Revision as of 10:10, 13 December 2024

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. 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 X {\displaystyle X} of a partially ordered set, or poset, P {\displaystyle P} , is a chain if the elements of X {\displaystyle X} are pairwise comparable, and it is an antichain if its elements are pairwise incomparable. If P {\displaystyle P} 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 P {\displaystyle P} contains no infinite antichain then, for every positive integer k {\displaystyle k} , there exist k {\displaystyle k} chains C 1 , C 2 , , C k {\displaystyle C_{1},C_{2},\dots ,C_{k}} and a partition of P {\displaystyle P} into disjoint antichains ( A i : i I ) {\displaystyle (A_{i}:i\in I)} such that each A i {\displaystyle A_{i}} meets min ( | A i | , k ) {\displaystyle \min(\left|A_{i}\right|,k)} chains C j {\displaystyle C_{j}} .

For example, if P {\displaystyle P} is the poset on the set N × N {\displaystyle \mathbb {N} \times \mathbb {N} } with ordering given by setting ( x , y ) ( u , v ) {\displaystyle (x,y)\leq (u,v)} if and only if x u {\displaystyle x\leq u} and y v {\displaystyle y\leq v} , then the k = 1 {\displaystyle k=1} case of the conjecture holds by taking C = { ( 0 , y ) : y N }  and  A i = { ( x , y ) P : x + y = i } {\displaystyle C=\{(0,y):y\in \mathbb {N} \}{\text{ and }}A_{i}=\{(x,y)\in P:x+y=i\}} for all integers i 0 {\displaystyle i\geq 0} .

Disproof

Lawrence Hollom disproved this conjecture in his paper titled "A Resolution of the Aharoni-Korman Conjecture". Its disproof was also discussed in great length on Trefor Bazett's YouTube channel.

  1. "Search | arXiv e-print repository". arxiv.org. Retrieved 2024-12-13.
  2. Dr. Trefor Bazett (2024-12-11). Math News: The Fish Bone Conjecture has been deboned!!. Retrieved 2024-12-13 – via YouTube.