Strongly Connected Orientations and Integer Lattices

References

• [1] Abdi A, Cornuéjols G, Zlatin M (2023) On packing dijoins in digraphs and weighted digraphs. SIAM J. Discrete Math. 37(4):2417–2461.Crossref, Google Scholar
• [2] Abdi A, Cornuéjols G, Guenin B, Tunçel L (2024) Total dual dyadicness and dyadic generating sets. Math. Programming 206(1):125–143.Crossref, Google Scholar
• [3] Abdi A, Cornuéjols G, Guenin B, Tunçel L (2025) Dyadic linear programming and extensions. Math. Programming 213(1–2):473–516.Crossref, Google Scholar
• [4] Brändén P, Huh J (2020) Lorentzian polynomials. Ann. Math. 192(3):821–891.Crossref, Google Scholar
• [5] Cornuéjols G (2001) Combinatorial Optimization: Packing and Covering (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar
• [6] Cornuéjols G, Liu S, Ravi R (2024) Approximately packing dijoins via nowhere-zero flows. Integer Programming Combin. Optim. 25th Internat. Conf. IPCO 2024 Wroclaw Poland July 3–5 2024 (Springer-Verlag, Berlin), 71–84.Google Scholar
• [7] de Carvalho MH, Lucchesi CL, Murty USR (2002) Optimal ear decompositions of matching covered graphs and bases for the matching lattice. J. Combin. Theory Ser. B 85(1):59–93.Crossref, Google Scholar
• [8] de Werra D (1971) Equitable colorations of graphs. Revue française d’informatique et de recherche opérationnelle. Série rouge 5(R3):3–8.Google Scholar
• [9] Dummit DS, Foote RM (2004) Abstract Algebra, 3rd ed. (John Wiley and Sons, Hoboken, NJ).Google Scholar
• [10] Edmonds J, Giles R (1977) A min-max relation for submodular functions on graphs. Stud. Integer Programming Proc. Workshop Bonn 1975, 185–204.Google Scholar
• [11] Edmonds J, Pulleyblank WR, Lovász L (1982) Brick decompositions and the matching rank of graphs. Combinatorica 2(3):247–274.Crossref, Google Scholar
• [12] Frank A (2011) Connections in Combinatorial Optimization, Oxford Lecture Series in Mathematics and Its Applications (Oxford University Press, Oxford, UK).Google Scholar
• [13] Fujishige S (1984) Structures of polyhedra determined by submodular functions on crossing families. Math. Programming 29(2):125–141.Crossref, Google Scholar
• [14] Gerards AMH, Sebő A (1987) Total dual integrality implies local strong unimodularity. Math. Programming 38(1):69–73.Crossref, Google Scholar
• [15] Guenin B, Hwang S (2024) Dyadic packing of dijoins. SIAM J. Discrete Math. 39(1):593–606.Google Scholar
• [16] Haase C, Paffenholz A, Piechnik LC, Santos F (2021) Existence of unimodular triangulations—Positive results. Memoirs Amer. Math. Soc. 270(1321):1–83.Crossref, Google Scholar
• [17] Lovász L (1987) Matching structure and the matching lattice. J. Combin. Theory Ser. B. 43(2):187–222.Crossref, Google Scholar
• [18] Lovász L, Plummer MD (2009) Matching Theory, vol. 367 (AMS Chelsea Publishing, Providence, RI).Crossref, Google Scholar
• [19] Lucchesi CL, Younger DH (1978) A minimax theorem for directed graphs. J. London Math. Soc. s2-17(3):369–374.Crossref, Google Scholar
• [20] Martinet J (2003) Perfect Lattices in Euclidean Spaces (Springer-Verlag, Berlin).Crossref, Google Scholar
• [21] Murota K (2003) Discrete Convex Analysis (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar
• [22] Schrijver A (1980) A counterexample to a conjecture of Edmonds and Giles. Discrete Math. 32(2):213–215.Crossref, Google Scholar
• [23] Schrijver A (1998) Theory of Linear and Integer Programming (John Wiley & Sons, Chichester, UK).Google Scholar
• [24] Schrijver A (2003) Combinatorial Optimization: Polyhedra and Efficiency, Algorithms and Combinatorics (Springer, Berlin).Google Scholar
• [25] Schrijver A (2016) Observations on Woodall’s conjecture. Accessed January 1, 2025, https://homepages.cwi.nl/∼lex/files/woodall.pdf.Google Scholar
• [26] Woodall DR (1978) Menger and König systems. Alavi Y, Lick D, eds. Theory and Applications of Graphs, Lecture Notes in Mathematics, vol. 642 (Springer, Berlin), 620–635.Crossref, Google Scholar