Intersecting designs from linear programming and graphs of diameter two

DOI10.1016/0012-365X(92)00478-AzbMath0799.05043OpenAlexW2090210357MaRDI QIDQ1322228

Zoltan Fueredi

Publication date: 5 May 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)00478-a

zbMATH Keywords

linear programmingdiameterextremal problemsdesignsintersecting hypergraphintersecting designs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Linear programming (90C05) Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

On intersecting hypergraphs ⋮ On maximal triangle‐free graphs ⋮ Saturating sets in projective planes and hypergraph covers ⋮ Steiner diameter, maximum degree and size of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the fractional matching polytope of a hypergraph
• Covering pairs by \(q^ 2+q+1\) sets
• Covering the complete graph by partitions
• t-expansive and t-wise intersecting hypergraphs
• Finite projective spaces and intersecting hypergraphs
• Symmetric designs as the solution of an extremal problem in combinatorial set theory
• Golden ratios in a pairs covering problem
• Maximum degree and fractional matchings in uniform hypergraphs
• Covering \(t\)-element sets by partitions
• On Hajnal's triangle-free game
• Matchings and covers in hypergraphs
• Intersecting families of finite sets and fixed-point-free 2-elements
• Minimalk-saturated and color critical graphs of prescribed minimum degree
• Regularity Conditions and Intersecting Hypergraphs
• DISJOINT TRIPLES IN A 3-GRAPH WITH GIVEN MAXIMAL DEGREE
• On the Fractional Covering Number of Hypergraphs
• A Theorem on Coloring the Lines of a Network

This page was built for publication: Intersecting designs from linear programming and graphs of diameter two