Intersecting designs from linear programming and graphs of diameter two

DOI10.1016/0012-365X(92)00478-AMaRDI QIDQ1322228zbMATH OpenOpenAlexFDO

Authors Zoltán Füredi

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

designsdiameterextremal problemsintersecting designsintersecting hypergraphlinear programming

Mathematics Subject Classification ID

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

Review text

This paper surveys some extremal problems whose solutions naturally lead to linear programming on an intersecting hypergraph, and obtains designs as solutions of extremal problems in hypergraph theory. In this way the author proposes several problems and conjectures for further research.

Cites work

• A Theorem on Coloring the Lines of a Network
• Covering \(t\)-element sets by partitions
• Covering pairs by q^ 2+q+1 sets
• Covering the complete graph by partitions
• DISJOINT TRIPLES IN A 3-GRAPH WITH GIVEN MAXIMAL DEGREE
• Finite projective spaces and intersecting hypergraphs
• Golden ratios in a pairs covering problem
• scientific article; zbMATH DE number 4134083 (Why is no real title available?)
• scientific article; zbMATH DE number 3882468 (Why is no real title available?)
• scientific article; zbMATH DE number 3865320 (Why is no real title available?)
• scientific article; zbMATH DE number 3941572 (Why is no real title available?)
• scientific article; zbMATH DE number 4008407 (Why is no real title available?)
• scientific article; zbMATH DE number 4008431 (Why is no real title available?)
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3691382 (Why is no real title available?)
• scientific article; zbMATH DE number 3695222 (Why is no real title available?)
• scientific article; zbMATH DE number 3739577 (Why is no real title available?)
• scientific article; zbMATH DE number 3739590 (Why is no real title available?)
• scientific article; zbMATH DE number 3743256 (Why is no real title available?)
• scientific article; zbMATH DE number 3745219 (Why is no real title available?)
• scientific article; zbMATH DE number 3534505 (Why is no real title available?)
• scientific article; zbMATH DE number 3616474 (Why is no real title available?)
• scientific article; zbMATH DE number 3435527 (Why is no real title available?)
• scientific article; zbMATH DE number 3232670 (Why is no real title available?)
• scientific article; zbMATH DE number 3344591 (Why is no real title available?)
• scientific article; zbMATH DE number 3353329 (Why is no real title available?)
• Intersecting families of finite sets and fixed-point-free 2-elements
• Matchings and covers in hypergraphs
• Maximum degree and fractional matchings in uniform hypergraphs
• Minimalk-saturated and color critical graphs of prescribed minimum degree
• On Hajnal's triangle-free game
• On the Fractional Covering Number of Hypergraphs
• On the fractional matching polytope of a hypergraph
• Regularity Conditions and Intersecting Hypergraphs
• Symmetric designs as the solution of an extremal problem in combinatorial set theory
• t-expansive and t-wise intersecting hypergraphs

Cited in

(5)

• On intersecting hypergraphs
• Saturating sets in projective planes and hypergraph covers
• Steiner diameter, maximum degree and size of a graph
• On maximal triangle‐free graphs
• scientific article; zbMATH DE number 2191993 (Why is no real title available?)

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

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