Hypergraphs in which all disjoint pairs have distinct unions

DOI10.1007/BF02579216zbMath0555.05006OpenAlexW2001029390MaRDI QIDQ760430

Zoltan Fueredi

Publication date: 1984

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (17)

Regular subgraphs of uniform hypergraphs ⋮ Minimal paths and cycles in set systems ⋮ An intersection theorem for four sets ⋮ Finding a minimal spanning hypertree of a weighted hypergraph ⋮ Two-regular subgraphs of odd-uniform hypergraphs ⋮ Extremal Problems for Hypergraph Blowups of Trees ⋮ New bounds for a hypergraph bipartite Turán problem ⋮ Turán problems and shadows. I: Paths and cycles ⋮ Small maximally disjoint union-free families ⋮ Turán number of special four cycles in triple systems ⋮ The Largest Minimum Codegree of a 3-Graph Without a Generalized 4-Cycle ⋮ Relative Turán numbers for hypergraph cycles ⋮ The maximum size of hypergraphs without generalized 4-cycles ⋮ Two-regular subgraphs of hypergraphs ⋮ A hypergraph extension of the bipartite Turán problem ⋮ Structure and stability of triangle-free set systems ⋮ Finding the shortest path for a Hypergraph

Cites Work

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

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