Almost cross-intersecting and almost cross-Sperner pairs of families of sets
From MaRDI portal
Publication:2376112
DOI10.1007/S00373-012-1138-2zbMATH Open1267.05280OpenAlexW2048043479MaRDI QIDQ2376112FDOQ2376112
Authors: Dániel Gerbner, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós, Vajk Szécsi
Publication date: 26 June 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1138-2
Recommendations
Cites Work
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On generalized graphs
- Almost Intersecting Families of Sets
- Some best possible inequalities concerning cross-intersecting families
- Title not available (Why is that?)
- On cross-intersecting families of sets
- Cross-intersecting families of finite sets
- On a restricted cross-intersection problem
- Exact bounds on cross-intersecting families
- Some Inequalities Concerning Cross-Intersecting Families
- Weighted cross-intersecting families
- Cross-Sperner families
- Forbidden intersection patterns in the families of subsets
Cited In (8)
- Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem
- Almost Intersecting Families of Sets
- Generalized laminar families and certain forbidden matrices
- Title not available (Why is that?)
- Almost intersecting families
- Circulant almost cross intersecting families
- Cross-Sperner families
- Improved bounds for cross-Sperner systems
This page was built for publication: Almost cross-intersecting and almost cross-Sperner pairs of families of sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376112)