t-expansive and t-wise intersecting hypergraphs

DOI10.1007/BF01788079zbMath0594.05050OpenAlexW1966436600MaRDI QIDQ1076693

Zoltan Fueredi

Publication date: 1986

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

factor-critical graphsGallai's theoremhypergraph generalization

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

Finite projective spaces and intersecting hypergraphs ⋮ Minimal connected \(\tau\)-critical hypergraphs ⋮ Covering \(t\)-element sets by partitions ⋮ Matchings and covers in hypergraphs ⋮ A hypergraph version of the Gallai-Edmonds Theorem ⋮ Covering pairs by \(q^ 2+q+1\) sets ⋮ Intersecting designs from linear programming and graphs of diameter two

Cites Work

• Unnamed Item
• Unnamed Item
• On coverings of a finite set: Depth and subcovers
• Critical hypergraphs and interesting set-pair systems
• Finite projective spaces and intersecting hypergraphs
• On the kernel of intersecting families
• Maximum degree and fractional matchings in uniform hypergraphs
• Intersection Theorems for Systems of Sets
• Sets of finite sets satisfying union conditions
• Paths, Trees, and Flowers
• A finite set covering theorem

This page was built for publication: t-expansive and t-wise intersecting hypergraphs