Geometrical solution of an intersection problem for two hypergraphs
From MaRDI portal
Publication:798334
DOI10.1016/S0195-6698(84)80026-8zbMath0546.05048OpenAlexW2055204325MaRDI QIDQ798334
Publication date: 1984
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(84)80026-8
Related Items (19)
Combinatorics in the exterior algebra and the Bollobás Two Families Theorem ⋮ A new Bollobás-type inequality and applications to \(t\)-intersecting families of sets ⋮ On the Erdős-Ko-Rado theorem and the Bollobás theorem for \(t\)-intersecting families ⋮ On two set-systems with restricted cross-intersections ⋮ On the kernel of intersecting families ⋮ Set systems related to a house allocation problem ⋮ Problems and results on 1-cross-intersecting set pair systems ⋮ On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme ⋮ Properties of intersecting families of ordered sets ⋮ Difference graphs ⋮ Intersecting families of discrete structures are typically trivial ⋮ A note on kernels of intersecting families ⋮ Flattening rank and its combinatorial applications ⋮ A generalization of the Bollobás set pairs inequality ⋮ Matchings and covers in hypergraphs ⋮ A Helly type theorem for hypersurfaces ⋮ Bollobás-type theorems for hemi-bundled two families ⋮ Collapsibility of simplicial complexes of hypergraphs ⋮ Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extremal problem for two families of sets
- The orchard problem
- Solution of a problem of A. Ehrenfeucht and J. Mycielski
- On two Combinatorial Problems Arising from Automata Theory
- A Problem in Graph Theory
- On generalized graphs
This page was built for publication: Geometrical solution of an intersection problem for two hypergraphs
