Geometrical solution of an intersection problem for two hypergraphs

DOI10.1016/S0195-6698(84)80026-8MaRDI QIDQ798334zbMATH OpenOpenAlexFDO

Authors Zoltán Füredi

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

zbMATH Keywords

\(\tau\) -critical hypergraphsintersection problem

Mathematics Subject Classification ID

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

Recommendations

• The intersection theorem for direct products
• Finite projective spaces and intersecting hypergraphs
• Intersection theorems under dimension constraints
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• scientific article; zbMATH DE number 939034

Cites work

• A Problem in Graph Theory
• An extremal problem for two families of sets
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 3722680 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3561367 (Why is no real title available?)
• scientific article; zbMATH DE number 3613058 (Why is no real title available?)
• scientific article; zbMATH DE number 3275275 (Why is no real title available?)
• scientific article; zbMATH DE number 3370377 (Why is no real title available?)
• On generalized graphs
• On two Combinatorial Problems Arising from Automata Theory
• Solution of a problem of A. Ehrenfeucht and J. Mycielski
• The orchard problem

Cited in

(29)

• Intersection theorems for vector spaces
• Finite projective spaces and intersecting hypergraphs
• On the kernel of intersecting families
• The intersection theorem for direct products
• Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration
• On the Erdős-Ko-Rado theorem and the Bollobás theorem for t-intersecting families
• Matchings and covers in hypergraphs
• A Helly type theorem for hypersurfaces
• A new Bollobás-type inequality and applications to \(t\)-intersecting families of sets
• On two set-systems with restricted cross-intersections
• Intersection sizes of linear subspaces with the hypercube
• Flattening rank and its combinatorial applications
• A generalization of the Bollobás set pairs inequality
• Bollobás-type theorems for hemi-bundled two families
• Set systems related to a house allocation problem
• Intersecting families of discrete structures are typically trivial
• A note on kernels of intersecting families
• Collapsibility of simplicial complexes of hypergraphs
• Intersection theorems under dimension constraints
• Combinatorics in the exterior algebra and the Bollobás two families theorem
• Difference graphs
• 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
• Variations on the Bollobás set-pair theorem
• \(K_r\)-saturated graphs and the two families theorem
• Some new Bollobás-type inequalities
• On Bollobás-type theorems of d-tuples
• Variations on Bollobás systems of d-partitions
• Properties of intersecting families of ordered sets

This page was built for publication: Geometrical solution of an intersection problem for two hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798334)