Pages that link to "Item:Q1329820"

The following pages link to Inequalities for minimal covering sets in set systems of given rank (Q1329820):

Displaying 11 items.

• On the distribution of the domination number for random class cover catch digraphs (Q158221) (← links)
• An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\) (Q501681) (← links)
• The distribution of the relative arc density of a family of interval catch digraph based on uniform data (Q715495) (← links)
• Extension of one-dimensional proximity regions to higher dimensions (Q991185) (← links)
• The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data (Q998418) (← links)
• Minimum number of elements of representing a set system of given rank (Q1823939) (← links)
• Pseudo sunflowers (Q2143417) (← links)
• An investigation of new graph invariants related to the domination number of random proximity catch digraphs (Q2276421) (← links)
• The Binomial <i>k</i>‐Clique (Q4909342) (← links)
• A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families (Q5222551) (← links)
• On the size of maximal intersecting families (Q6632791) (← links)