A counterexample to Aharoni's strongly maximal matching conjecture (Q1910586): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q123016560 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Infinite matching theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Problems and results in discrete mathematics / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(95)00243-p / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2027345419 / rank | |||
Normal rank |
Latest revision as of 12:04, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A counterexample to Aharoni's strongly maximal matching conjecture |
scientific article |
Statements
A counterexample to Aharoni's strongly maximal matching conjecture (English)
0 references
25 March 1996
0 references
Aharoni conjectured that in every family \(A\) of finite sets a subfamily \(B\) of disjoint sets exists, so that no replacement of \(k\) of them by more than \(k\) sets from \(A\) results again in a subfamily of disjoint sets. The authors present as a counterexample the family of those finite subets of the set of natural numbers whose cardinality and smallest element coincide.
0 references
strongly maximal matching
0 references
Aharoni's conjecture
0 references
infinite hypergraph
0 references
counterexample
0 references