On the matching arrangement of a graph and properties of its characteristic polynomial

DOI10.1515/DMA-2024-0022MaRDI QIDQ6647129

Alexey I. Bolotnikov

Publication date: 3 December 2024

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

zbMATH Keywords

partially ordered setmatroidhyperplane arrangementgraphical arrangementmaximal matching problem

Mathematics Subject Classification ID

Graph polynomials (05C31) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Cites Work

• Title not available (Why is that?)
• Congruent graphs and the connectivity of graphs
• Asymptotics of the number of threshold functions and the singularity probability of random \( \{\pm 1\}\)-matrices
• 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
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
• Abstract Linear Dependence and Lattices
• Arrangements of hyperplanes and the number of threshold functions

This page was built for publication: On the matching arrangement of a graph and properties of its characteristic polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6647129)