Circulant almost cross intersecting families

DOI10.26493/2590-9770.1414.f67zbMath1497.05255arXiv2005.07907OpenAlexW3178789774MaRDI QIDQ5045251

Michal Parnas

Publication date: 4 November 2022

Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.07907

zbMATH Keywords

circulant matrixBoolean rankintersecting setsisolation set

Mathematics Subject Classification ID

Extremal set theory (05D05) Boolean and Hadamard matrices (15B34)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isolation number versus Boolean rank
• Intersection patterns of convex sets
• The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
• On circulant Boolean matrices
• An extremal problem for two families of sets
• Some best possible inequalities concerning cross-intersecting families
• Almost cross-intersecting and almost cross-Sperner pairs of families of sets
• The Boolean rank of the uniform intersection matrix and a family of its submatrices
• On the complexity of Boolean matrix ranks
• The maximum sum and the maximum product of sizes of cross-intersecting families
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On maximal isolation sets in the uniform intersection matrix
• Circulant Boolean relation matrices
• Communication Complexity
• Almost Intersecting Families of Sets
• Hypergraphs of Bounded Disjointness
• Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP
• On generalized graphs
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• A new generalization of the Erdős-Ko-Rado theorem

This page was built for publication: Circulant almost cross intersecting families