The local dyadic conjecture

DOI10.1007/978-3-032-28691-8_10MaRDI QIDQ7349453zbMATH OpenFDO

Authors Mahtab Alghasi, Bertrand Guenin, Levent Tunçel

Publication date 16 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-28691-8_10

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Cites work

• A Minimax Theorem for Directed Graphs
• A Solution of the Shannon Switching Game
• A two-commodity cut theorem
• Bottleneck extrema
• Combinatorial optimization. Packing and covering
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Dyadic linear programming and extensions
• Dyadic packing of dijoins
• Lectures on Polytopes
• On certain polytopes associated with graphs
• On combinatorial properties of binary spaces
• On dyadic fractional packings of T-joins
• On the intersections of circuits and cocircuits in matroids
• Packing odd circuits in Eulerian graphs
• Recognizing even-cycle and even-cut matroids
• Strongly connected orientations and integer lattices
• The Forbidden Minors of Binary Clutters
• Total dual dyadicness and dyadic generating sets

This page was built for publication: The local dyadic conjecture

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