Unavoidable subhypergraphs: a-clusters
From MaRDI portal
Publication:2851439
DOI10.1016/j.endm.2009.07.011zbMath1272.05138MaRDI QIDQ2851439
Publication date: 10 October 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.011
Related Items
Cites Work
- Set systems without a simplex or a cluster
- On finite set-systems whose every intersection is a kernel of a star
- On disjointly representable sets
- On the VC-dimension of uniform hypergraphs
- Set systems with union and intersection constraints
- On a packing and covering problem
- Forbidding just one intersection
- Exact solution of some Turán-type problems
- Counterexample to the Frankl-Pach conjecture for uniform, dense families
- Proof of a conjecture of Erdős on triangles in set-systems
- Erdős--Ko--Rado for three sets
- An intersection theorem for four sets
- Families of Sets with Intersecting Clusters
- An Extremal Set-Intersection Theorem
- A new generalization of the Erdős-Ko-Rado theorem