On combinatorial properties of binary spaces

DOI10.1007/3-540-59408-6_53zbMath1498.90197OpenAlexW1598408979MaRDI QIDQ5101417

Beth Novick, András Sebő

Publication date: 30 August 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59408-6_53

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (3)

Cuboids, a class of clutters ⋮ On ideal clutters, metrics and multiflows ⋮ Ideal clutters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Klein bottle and multicommodity flows
• Recognizing max-flow min-cut path matrices
• A short proof of Tutte's characterization of totally unimodular matrices
• Decomposition of regular matroids
• Matroids and multicommodity flows
• Recognizing graphic matroids
• The matroids with the max-flow min-cut property
• A note on the production of matroid minors
• A minimax theorem on circuits in projective graphs
• Ideal 0, 1 matrices
• Independence and port oracles for matroids, with an application to computational learning theory
• A generalized cut-condition for multiflows in matroids
• Conservative weightings and ear-decompositions of graphs
• The graph genus problem is NP-complete
• The Forbidden Minors of Binary Clutters
• A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS
• Matching, Euler tours and the Chinese postman
• A Solution of the Shannon Switching Game
• Bottleneck extrema
• Integer multiflows and metric packings beyond the cut condition

This page was built for publication: On combinatorial properties of binary spaces