On characterizing the extreme points of the generalized transitive tournament polytope
From MaRDI portal
Publication:1792114
DOI10.1016/j.endm.2018.06.047zbMath1397.05074OpenAlexW2883115751WikidataQ129559452 ScholiaQ129559452MaRDI QIDQ1792114
Publication date: 11 October 2018
Full work available at URL: https://doi.org/10.1016/j.endm.2018.06.047
Extremal problems in graph theory (05C35) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Hypergraphs (05C65) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Decomposing weighted digraphs into sums of chains
- Vertices of the generalized transitive tournament polytope
- Half-integrality of vertices of the generalized transitive tournament polytope \((n=6)\)
- Rational and integral \(k\)-regular matrices.
- On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope
- Optimization with binet matrices
- Unnamed Item
- Unnamed Item
This page was built for publication: On characterizing the extreme points of the generalized transitive tournament polytope