Circulant almost cross intersecting families (Q5045251): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.26493/2590-9770.1414.f67 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q4352269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isolation number versus Boolean rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum sum and the maximum product of sizes of cross-intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circulant Boolean relation matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4116627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On circulant Boolean matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem for two families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some best possible inequalities concerning cross-intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost cross-intersecting and almost cross-Sperner pairs of families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost Intersecting Families of Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection patterns of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean rank of the uniform intersection matrix and a family of its submatrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal isolation sets in the uniform intersection matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new generalization of the Erdős-Ko-Rado theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs of Bounded Disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of Boolean matrix ranks / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.26493/2590-9770.1414.F67 / rank
 
Normal rank

Latest revision as of 15:43, 30 December 2024

scientific article; zbMATH DE number 7612270
Language Label Description Also known as
English
Circulant almost cross intersecting families
scientific article; zbMATH DE number 7612270

    Statements

    Circulant almost cross intersecting families (English)
    0 references
    0 references
    4 November 2022
    0 references
    circulant matrix
    0 references
    intersecting sets
    0 references
    Boolean rank
    0 references
    isolation set
    0 references

    Identifiers