On Kelley’s intersection numbers
Fred Galvin, Karel Prikry
Abstract
Open-access reader
Fred Galvin, Karel Prikry
Abstract
Open-access reader
We introduce a notion of weak intersection number of a collection of sets, modifying the notion of intersection number due to J.L. Kelley, and obtain an analogue of Kelley’s characterization of Boolean algebras which support a finitely additive strictly positive measure. We also consider graph-theoretic reformulations of the notions of intersection number and weak intersection number.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We introduce a notion of weak intersection number of a collection of sets, modifying the notion of intersection number due to J.L. Kelley, and obtain an analogue of Kelley’s characterization of Boolean algebras which support a finitely additive strictly positive measure. We also consider graph-theoretic reformulations of the notions of intersection number and weak intersection number.
Key concepts: Intersection (aeronautics), Mathematics, Intersection graph, Characterization (materials science), Combinatorics, Graph, Measure (data warehouse), Discrete mathematics