Combinatorial properties of systems of sets
From MaRDI portal
Publication:1248627
DOI10.1016/0097-3165(78)90060-2zbMath0383.05002OpenAlexW2013188591WikidataQ106084760 ScholiaQ106084760MaRDI QIDQ1248627
No author found.
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
Permutations, words, matrices (05A05) Other combinatorial number theory (11B75) Other combinatorial set theory (03E05)
Related Items (22)
2-Cancellative Hypergraphs and Codes ⋮ UPPER BOUNDS FOR SUNFLOWER-FREE SETS ⋮ On the extremal combinatorics of the Hamming space ⋮ Multicolour Sunflowers ⋮ Constructions and bounds for \((m,t)\)-splitting systems ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ Intersection statements for systems of sets ⋮ On the size of set systems on \([n\) not containing weak \((r,\Delta)\)-systems] ⋮ On sunflowers and matrix multiplication ⋮ Sunflowers and testing triangle-freeness of functions ⋮ Equicovering subgraphs of graphs and hypergraphs ⋮ Near-sunflowers and focal families ⋮ On the combinatorial problems which I would most like to see solved ⋮ On set systems not containing delta systems ⋮ On cap sets and the group-theoretic approach to matrix multiplication ⋮ Forbidden Intersections ⋮ Delta-systems and qualitative (in)dependence ⋮ Improved bounds for the sunflower lemma ⋮ Combinatorial analysis. (Matrix problems, choice theory) ⋮ On set systems without weak 3-\(\Delta\)-subsystems ⋮ Specified intersections ⋮ Families of finite sets in which no set is covered by the union of \(r\) others
Cites Work
This page was built for publication: Combinatorial properties of systems of sets