Counterexample to a conjecture of Aharoni and Korman

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.02296 v1 pith:2RHCP6LN submitted 2022-05-04 math.CO

Dominic van der Zypen This is my paper · ORCID

classification math.CO

keywords aharonicounterexamplekormanconjectureconjecturedcoveredgesfinite

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

Ron Aharoni and Vladimir Korman conjectured that any hypergraph with only finite edges has a strongly minimal cover. We present a counterexample.

Forward citations

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

The Aharoni--Korman conjecture is false
math.CO 2024-11 accept novelty 9.0 of 10 partial

A countable poset with no infinite antichain is constructed that has no 'spine', disproving the Aharoni-Korman (fishbone) conjecture of 1992.