On the kernel of intersecting families

DOI10.1007/BF01788533zbMath0651.05004OpenAlexW2007737827MaRDI QIDQ1106213

Zoltan Fueredi, Noga Alon

Publication date: 1987

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01788533

zbMATH Keywords

t-wise s-intersecting family

Mathematics Subject Classification ID

Hypergraphs (05C65) Permutations, words, matrices (05A05)

Related Items

t-expansive and t-wise intersecting hypergraphs, A general framework for discovering and proving theorems of the Erdős- Ko-Rado type, A note on kernels of intersecting families, Matchings and covers in hypergraphs, Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersection patterns of convex sets
• Geometrical solution of an intersection problem for two hypergraphs
• An extremal problem for sets with applications to graph theory
• A simple proof of the upper bound theorem
• Critical hypergraphs and interesting set-pair systems
• Finite projective spaces and intersecting hypergraphs
• An extremal problem for two families of sets
• Interpolation of functions over a measure space and conjectures about memory
• On intersecting families of finite sets