Cutting planes for families implying Frankl’s conjecture

DOI10.1090/mcom/3461zbMath1429.05199arXiv1702.05947OpenAlexW2785044350WikidataQ123333792 ScholiaQ123333792MaRDI QIDQ5207443

Jonad Pulaj

Publication date: 27 December 2019

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.05947

zbMATH Keywords

integer programmingextremal combinatoricsunion-closed familiesFrankl's conjecturecutting-plane method

Mathematics Subject Classification ID

Integer programming (90C10) Extremal set theory (05D05)

Related Items (4)

Characterizing 3-Sets in Union-Closed Families ⋮ Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework ⋮ A computational status update for exact rational mixed integer programming ⋮ A computational status update for exact rational mixed integer programming

Uses Software

• SCIP
• CPLEX
• Gurobi
• VIPR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New conjectures for union-closed families
• The graph formulation of the union-closed sets conjecture
• A hybrid branch-and-bound approach for exact rational mixed-integer programming
• FC-families and improved bounds for Frankl's conjecture
• The journey of the union-closed sets conjecture
• The 11-element case of Frankl's conjecture
• Union-closed families
• Families implying the Frankl conjecture
• Verifying integer programming results
• Formalizing Frankl’s Conjecture: FC-Families
• An attempt at frankl’s conjecture
• Proofs from THE BOOK
• On union-closed families. I

This page was built for publication: Cutting planes for families implying Frankl’s conjecture