On families of finite sets no two of which intersect in a singleton
From MaRDI portal
Publication:4165389
DOI10.1017/S0004972700025521zbMath0385.05003MaRDI QIDQ4165389
Publication date: 1977
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Related Items (26)
Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three ⋮ Turán problems and shadows. II: Trees ⋮ Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths ⋮ Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs ⋮ Extremal Problems for Hypergraph Blowups of Trees ⋮ Integer sequences without singleton intersection ⋮ Anti-Ramsey number of disjoint union of star-like hypergraphs ⋮ Extremal problems and coverings of the space ⋮ Hypergraph Turán numbers of linear cycles ⋮ The structure of large intersecting families ⋮ On the combinatorial problems which I would most like to see solved ⋮ Turán problems and shadows. I: Paths and cycles ⋮ A new generalization of the Erdős-Ko-Rado theorem ⋮ Union-intersecting set systems ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ On multicolor Ramsey numbers for loose \(k\)-paths of length three ⋮ Erdös–Ko–Rado Theorem—22 Years Later ⋮ Linear trees in uniform hypergraphs ⋮ Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ An extremal problem for 3-graphs ⋮ Families of finite sets with prescribed cardinalities for pairwise intersections ⋮ Linear dependencies among subsets of a finite set ⋮ An extremal set theoretical characterization of some Steiner systems ⋮ Turán Problems and Shadows III: Expansions of Graphs ⋮ Forbidding just one intersection
Cites Work
This page was built for publication: On families of finite sets no two of which intersect in a singleton
