Idealness of k-wise intersecting families

Abdi, Ahmad ORCID: 0000-0002-3008-4167, Cornuéjols, Gérard, Huynh, Tony and Lee, Dabeen (2020) Idealness of k-wise intersecting families. In: Bienstock, Daniel and Zambelli, Giacomo, (eds.) Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Berlin / Heidelberg, GBR, 1 - 12. ISBN 9783030457709

Text (Idealness of k-wise Intersecting families) - Accepted Version Download (513kB)

• Scopus publication
• Author

Abstract

A clutter is k-wise intersecting if every k members have a common element, yet no element belongs to all members. We conjecture that every 4-wise intersecting clutter is non-ideal. As evidence for our conjecture, we prove it in the binary case. Two key ingredients for our proof are Jaeger’s 8-flow theorem for graphs, and Seymour’s characterization of the binary matroids with the sums of circuits property. As further evidence for our conjecture, we also note that it follows from an unpublished conjecture of Seymour from 1975.

Item Type:	Book Section
Official URL:	https://link.springer.com/conference/ipco
Additional Information:	© 2020 Springer Nature Switzerland AG
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Date Deposited:	15 May 2020 09:00
Last Modified:	20 Dec 2024 00:18
URI:	http://eprints.lse.ac.uk/id/eprint/104419

Actions (login required)

View Item