Lower bounds for cube-ideal set-systems

DOI10.1112/PLMS.70199MaRDI QIDQ7314969zbMATH OpenFDO

Authors Ahmad Abdi, Gérard Cornuéjols, Daniel Dadush, Mahsa Dalirrooyfard

Publication date 18 August 2026

Published in Proceedings of the London Mathematical Society. Third Series (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1112/PLMS.70199

Mathematics Subject Classification ID

Classical propositional logic (03B05) Combinatorial inequalities (05A20) Directed graphs (digraphs), tournaments (05C20) Hypergraphs (05C65) Graph theory (05Cxx) Inequalities and extremum problems involving convexity in convex geometry (52A40) Polytopes and polyhedra (52Bxx) Combinatorial optimization (90C27)

Cites work

• A bound for the number of vertices of a polytope with applications
• A characterization of weakly bipartite graphs
• A class of simple games
• A combinatorial problem; stability and order for models and theories in infinitary languages
• A Minimax Theorem for Directed Graphs
• A survey on flows in graphs and matroids
• Blocking and anti-blocking pairs of polyhedra
• Bottleneck extrema
• Characterizing polytopes in the 0/1-cube with bounded Chvátal-Gomory rank
• Combinatorial optimization. Packing and covering
• Congruent graphs and the connectivity of graphs
• Cuboids, a class of clutters
• Exponentially many perfect matchings in cubic graphs
• Forests, colorings and acyclic orientations of the square lattice
• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• scientific article; zbMATH DE number 3606472 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• Ideal 0, 1 matrices
• Idealness of \(k\)-wise intersecting families
• Incidence matrices with the consecutive 1’s property
• Matching theory
• Matching, Euler tours and the Chinese postman
• Matroids and multicommodity flows
• Maximum matching and a polyhedron with 0,1-vertices
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• On Packing Dijoins in Digraphs and Weighted Digraphs
• On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank
• On the computational complexity of the Jones and Tutte polynomials
• On the cycle polytope of a binary matroid
• On the density of families of sets
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• On the width-length inequality
• Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
• Resistant sets in the unit hypercube
• Resolution and the integrality of satisfiability problems

This page was built for publication: Lower bounds for cube-ideal set-systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314969)