Union-free hypergraphs and probability theory
From MaRDI portal
Publication:798335
DOI10.1016/S0195-6698(84)80025-6zbMATH Open0546.05049OpenAlexW2146586570MaRDI QIDQ798335FDOQ798335
Authors: Zoltán Füredi, Peter Frankl 
Publication date: 1984
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(84)80025-6
Recommendations
- On the structure of random hypergraphs
- Lower bounds for the probability of a union via chordal graphs
- On the upper tail problem for random hypergraphs
- On the probability of union in the $n$-space
- Dirac-type theorems in random hypergraphs
- Graph-based upper bounds for the probability of the union of events
- On the probability of independent sets in random graphs
- On the Choice Number of Random Hypergraphs
- On the decomposition of random hypergraphs
- Upper bounds for the probability of a union by multitrees
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graphs without quadrilaterals
- Three-graphs without two triples whose symmetric difference is contained in a third
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sidon sets in groups and induced subgraphs of Cayley graphs
- Union-free families of sets and equations over fields
- A new extremal property of Steiner triple-systems
- Intersections of k-element sets
Cited In (25)
- Applications of coding theory to communication combinatorial problems
- Size-maximal symmetric difference-free families of subsets of \([n]\)
- On Cancellative Set Families
- On the extremal combinatorics of the Hamming space
- Self-similarity bounds for locally thin set families
- New bounds on Simonyi's conjecture
- Cancellative pairs of families of sets
- Extremal problems whose solutions are the blowups of the small Witt- designs
- Coding for write-unidirectional memories and conflict resolution
- Title not available (Why is that?)
- A better bound for locally thin set families
- Title not available (Why is that?)
- Lower bounds for the probability of a union via chordal graphs
- Strongly separable matrices for nonadaptive combinatorial group testing
- The number of maximal independent sets in connected graphs
- Asymptotic solution of a Turán-type problem
- The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting
- Partial dependencies in relational databases and their realization
- Estimating the size of a union of random subsets of fixed cardinality
- Smart elements in combinatorial group testing problems with more defectives
- Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices
- A new upper bound for cancellative pairs
- New Turán Exponents for Two Extremal Hypergraph Problems
- 2-cancellative hypergraphs and codes
- Smart elements in combinatorial group testing problems
This page was built for publication: Union-free hypergraphs and probability theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798335)
