On a matching arrangement of a graph and \(LP\)-orientations of a matching polyhedron

DOI10.1134/s0001434623070283zbMath1526.05035arXiv2212.13749MaRDI QIDQ6063084

A. I. Bolotnikov

Publication date: 7 November 2023

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2212.13749

zbMATH Keywords

linear programminghyperplane arrangementmaximal matching problem

Mathematics Subject Classification ID

Random matrices (probabilistic aspects) (60B20) Linear programming (90C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Asymptotic enumeration (05A16) Topological properties in algebraic geometry (14F45)

Cites Work

• Combinatorics and topology of complements of hyperplanes
• A lower bound on the number of cells in arrangements of hyperplanes
• Asymptotics of the number of threshold functions and the singularity probability of random \( \{\pm 1\}\)-matrices
• On the number of domains of maximal dimension in partitions of projective spaces by hyperplane arrangements
• Orlik-Solomon algebras in algebra and topology
• Bounds for the number of threshold functions
• On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
• Maximum matching and a polyhedron with 0,1-vertices
• Partition of Space
• Graph-Theoretic Concepts in Computer Science
• Arrangements of hyperplanes and the number of threshold functions

This page was built for publication: On a matching arrangement of a graph and \(LP\)-orientations of a matching polyhedron