Idealness of k-wise intersecting families

12/02/2019
by   Ahmad Abdi, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/31/2023

A proof of the Prelov conjecture

In this paper we present a complete proof of a conjecture due to V. V. P...
research
07/27/2021

Partitioning all k-subsets into r-wise intersecting families

Let r ≥ 2, n and k be integers satisfying k ≤r-1/rn. In the original arX...
research
08/17/2021

A Note on the Permuted Puzzles Toy Conjecture

In this note, we show that a "Toy Conjecture" made by (Boyle, Ishai, Pas...
research
04/20/2020

Further Evidence Towards the Multiplicative 1-2-3 Conjecture

The product version of the 1-2-3 Conjecture, introduced by Skowronek-Kaz...
research
01/07/2020

Rainbow matchings in k-partite hypergraphs

In this paper, we prove a conjecture of Aharoni and Howard on the existe...
research
10/26/2020

A note on optimal degree-three spanners of the square lattice

In this short note, we prove that the degree-three dilation of the squar...
research
04/30/2023

On Rueppel's Linear Complexity Conjecture

Rueppel's conjecture on the linear complexity of the first n terms of th...

Please sign up or login with your details

Forgot password? Click here to reset