On cliques associated to 3-set packing problems

DOI10.1016/j.endm.2004.03.049zbMath1125.05315OpenAlexW2049629839MaRDI QIDQ3439164

Luis M. Torres

Publication date: 29 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.endm.2004.03.049

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Geometric algorithms and combinatorial optimization
• Covers and packings in a family of sets
• Perfect zero–one matrices
• On the facial structure of set packing polyhedra
• Blocking and anti-blocking pairs of polyhedra
• The Nonexistence of Certain Finite Projective Planes

This page was built for publication: On cliques associated to 3-set packing problems