Prefer a chat interface with context about you and your work?
Linear inequalities among graph invariants: Using <i>GraPHedron</i> to uncover optimal relationships
Abstract Optimality of a linear inequality in finitely many graph invariants is defined through a geometric approach. For a fixed number of graph vertices, consider all the tuples of values taken by the invariants on a selected class of graphs. Then form the polytope which is the convex hull of …