Hypergraphs in which all disjoint pairs have distinct unions

DOI10.1007/BF02579216zbMATH Open0555.05006OpenAlexW2001029390MaRDI QIDQ760430FDOQ760430

Authors: Zoltán Füredi 

Publication date: 1984

Published in: Combinatorica (Search for Journal in Brave)

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

Recommendations

• Small maximally disjoint union-free families
• Disjointly representing set systems
• The maximum number of disjoint pairs in a family of subsets
• On disjointly representable sets
• Disjoint edges in separated hypergraphs

zbMATH Keywords

bipartite graphdisjoint-union-freefamily of finite setsuniform 3-hypergraphs

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Cites Work

• On Graphs that do not Contain a Thomsen Graph
• Title not available (Why is that?)
• Graphs without quadrilaterals
• A new generalization of the Erdős-Ko-Rado theorem
• Title not available (Why is that?)
• An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
• A new extremal property of Steiner triple-systems
• On coloring graphs to maximize the proportion of multicolored k-edges
• Intersection Theorems on Structures
• A Balanced Incomplete Block Design

Cited In (24)

• Hypergraphs of Bounded Disjointness
• Turán number of special four cycles in triple systems
• Finding the shortest path for a Hypergraph
• DISJOINT r-TUPLES IN AN r-GRAPH WITH GIVEN MAXIMUM DEGREE
• Constructing union-free pairs of \(k\)-element subsets
• Extremal Problems for Hypergraph Blowups of Trees
• Minimal paths and cycles in set systems
• The largest minimum codegree of a 3-graph without a generalized 4-cycle
• Regular subgraphs of uniform hypergraphs
• Disjointly representing set systems
• The maximum size of hypergraphs without generalized 4-cycles
• Two-regular subgraphs of hypergraphs
• Relative Turán numbers for hypergraph cycles
• New bounds for a hypergraph bipartite Turán problem
• Title not available (Why is that?)
• Two-regular subgraphs of odd-uniform hypergraphs
• Turán problems and shadows. I: Paths and cycles
• Disjoint edges in separated hypergraphs
• Finding a minimal spanning hypertree of a weighted hypergraph
• Structure and stability of triangle-free set systems
• On disjointly representable sets
• A hypergraph extension of the bipartite Turán problem
• Small maximally disjoint union-free families
• An intersection theorem for four sets

This page was built for publication: Hypergraphs in which all disjoint pairs have distinct unions

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