Combinatorial properties of systems of sets
From MaRDI portal
Publication:1248627
DOI10.1016/0097-3165(78)90060-2zbMATH Open0383.05002OpenAlexW2013188591WikidataQ106084760 ScholiaQ106084760MaRDI QIDQ1248627FDOQ1248627
Authors: P. Erdős, Endre Szemerédi
Publication date: 1978
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(78)90060-2
Recommendations
Permutations, words, matrices (05A05) Other combinatorial number theory (11B75) Other combinatorial set theory (03E05)
Cites Work
Cited In (32)
- Title not available (Why is that?)
- Equicovering subgraphs of graphs and hypergraphs
- Set systems and families of permutations with small traces
- Title not available (Why is that?)
- Near-sunflowers and focal families
- Delta-systems and qualitative (in)dependence
- Sunflowers and testing triangle-freeness of functions
- Title not available (Why is that?)
- On the extremal combinatorics of the Hamming space
- On the combinatorial problems which I would most like to see solved
- UPPER BOUNDS FOR SUNFLOWER-FREE SETS
- Exchange properties of finite set-systems
- Multicolour sunflowers
- On the size of set systems on \([n]\) not containing weak \((r,\Delta)\)-systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- On cap sets and the group-theoretic approach to matrix multiplication
- Constructions and bounds for \((m,t)\)-splitting systems
- Structure and stability of triangle-free set systems
- Improved bounds for the sunflower lemma
- On set systems not containing delta systems
- On sunflowers and matrix multiplication
- Forbidden Intersections
- Families of finite sets in which no set is covered by the union of \(r\) others
- Proof of a conjecture of Erdős on triangles in set-systems
- Odd-sunflowers
- Specified intersections
- Intersection statements for systems of sets
- Combinatorial analysis. (Matrix problems, choice theory)
- New applications of the polynomial method: the cap set conjecture and beyond
- 2-cancellative hypergraphs and codes
- On set systems without weak 3-\(\Delta\)-subsystems
This page was built for publication: Combinatorial properties of systems of sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1248627)