Combinatorial geometry and graphs in an analysis of infeasible systems and pattern recognition
abstract simplicial complexmonotone Boolean functionpositive baseinfeasible system of linear inequalitiescommittee methodgraph of an independence systemhypergraph of an independence systeminfeasible system of constraints with monotonicity featuremaximal feasible subsystempolytope diagonal
Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20) Combinatorial aspects of block designs (05B05) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Hypergraphs (05C65) Combinatorial aspects of simplicial complexes (05E45) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Inequalities and extremum problems involving convexity in convex geometry (52A40) Boolean functions (06E30) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Other problems of combinatorial convexity (52A37) Linear inequalities of matrices (15A39) Gale and other diagrams (52B35)
This page was built for publication: Combinatorial geometry and graphs in an analysis of infeasible systems and pattern recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262897)
