Geometrical solution of an intersection problem for two hypergraphs

DOI10.1016/S0195-6698(84)80026-8zbMATH Open0546.05048OpenAlexW2055204325MaRDI QIDQ798334FDOQ798334

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

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

zbMATH Keywords

intersection problem\(\tau\) -critical hypergraphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A Problem in Graph Theory
• Title not available (Why is that?)
• On generalized graphs
• An extremal problem for two families of sets
• On two Combinatorial Problems Arising from Automata Theory
• The orchard problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Solution of a problem of A. Ehrenfeucht and J. Mycielski
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (24)

• On the Erdős-Ko-Rado theorem and the Bollobás theorem for \(t\)-intersecting families
• Problems and results on 1-cross-intersecting set pair systems
• A note on kernels of intersecting families
• Difference graphs
• Variations on the Bollobás set-pair theorem
• Finite projective spaces and intersecting hypergraphs
• A new Bollobás-type inequality and applications to \(t\)-intersecting families of sets
• On two set-systems with restricted cross-intersections
• Flattening rank and its combinatorial applications
• Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration
• A Helly type theorem for hypersurfaces
• Bollobás-type theorems for hemi-bundled two families
• Matchings and covers in hypergraphs
• Collapsibility of simplicial complexes of hypergraphs
• Set systems related to a house allocation problem
• Intersection theorems under dimension constraints
• \(K_r\)-saturated graphs and the two families theorem
• Combinatorics in the exterior algebra and the Bollobás Two Families Theorem
• A generalization of the Bollobás set pairs inequality
• On the kernel of intersecting families
• Intersection theorems for vector spaces
• On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme
• Intersecting families of discrete structures are typically trivial
• 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)