Pages that link to "Item:Q798335"
From MaRDI portal
The following pages link to Union-free hypergraphs and probability theory (Q798335):
Displayed 19 items.
- Extremal problems whose solutions are the blowups of the small Witt- designs (Q807640) (← links)
- Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices (Q875600) (← links)
- Applications of coding theory to communication combinatorial problems (Q916665) (← links)
- Partial dependencies in relational databases and their realization (Q1202886) (← links)
- New bounds on Simonyi's conjecture (Q1746583) (← links)
- Smart elements in combinatorial group testing problems (Q1752611) (← links)
- A new upper bound for cancellative pairs (Q1753087) (← links)
- Coding for write-unidirectional memories and conflict resolution (Q1823916) (← links)
- Cancellative pairs of families of sets (Q1893950) (← links)
- On the extremal combinatorics of the Hamming space (Q1894014) (← links)
- Asymptotic solution of a Turán-type problem (Q2276984) (← links)
- Size-maximal symmetric difference-free families of subsets of \([n]\) (Q2441347) (← links)
- Strongly separable matrices for nonadaptive combinatorial group testing (Q2659071) (← links)
- 2-Cancellative Hypergraphs and Codes (Q2883859) (← links)
- The number of maximal independent sets in connected graphs (Q3791174) (← links)
- Smart elements in combinatorial group testing problems with more defectives (Q5121559) (← links)
- New Turán Exponents for Two Extremal Hypergraph Problems (Q5138977) (← links)
- On Cancellative Set Families (Q5443805) (← links)
- A better bound for locally thin set families (Q5947361) (← links)