Combinatorial Optimization Problems for Systems of Subsets

DOI10.1137/1030133zbMath0711.05005OpenAlexW2060504595MaRDI QIDQ3495357

Peter C. Fishburn

Publication date: 1988

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1030133

zbMATH Keywords

Chvátal's conjectureequivalent conjecturesmaximum intersecting family

Mathematics Subject Classification ID

Nonlinear programming (90C30) Permutations, words, matrices (05A05) Other combinatorial set theory (03E05)

Related Items (6)

A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture ⋮ Chvátal's conjecture and correlation inequalities ⋮ Latent Subsets for Dual Intersecting Systems ⋮ Erdős-Ko-Rado theorems for permutations and set partitions ⋮ A new result on Chvátal's conjecture ⋮ Correlation in partially ordered sets

This page was built for publication: Combinatorial Optimization Problems for Systems of Subsets