Maximal k-intersecting families of subsets and Boolean functions

DOI10.1134/S1990478918040191MaRDI QIDQ4973228zbMATH OpenOpenAlexFDO

Authors Yu. A. Zuev

Publication date 2 December 2019

Published in Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1990478918040191

zbMATH Keywords

\(k\)-intersecting family of subsetslayer of the Boolean cubemonotone selfdual Boolean function

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Boolean functions (06E30)

Recommendations

• Intersecting families in a subset of Boolean lattices
• On the maximum number of distinct intersections in an intersecting family
• Intersections and distinct intersections in cross-intersecting families
• Maximal intersecting families
• Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration

Cites work

• Extremal problems among subsets of a set
• scientific article; zbMATH DE number 2047435 (Why is no real title available?)
• scientific article; zbMATH DE number 194333 (Why is no real title available?)
• scientific article; zbMATH DE number 2239573 (Why is no real title available?)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On Dedekind's Problem: The Number of Monotone Boolean Functions
• On the number of antichains in multilevelled ranked posets
• The number of k-undivided families of subsets of an n-element set (k-undivided Boolean functions of n-variables). III. The case when n is arbitrary and k 3

Cited in

(2)

• Some intersection theorems on two-valued functions
• On two intersecting set systems and k-continuous Boolean functions

This page was built for publication: Maximal \(k\)-intersecting families of subsets and Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4973228)