Cover Image

A Polyhedral Perspective on the Perfect Matching Lattice

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Silina, Olha
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05C70, 90C27 G.2.2; G.2.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the characterization of graphs with tree 3-spanners
by: Lin, Lan, et al.
Published: (2025)

New results on graph matching from degree preserving growth
by: Erdős, Péter L., et al.
Published: (2022)

A counterexample to the conjecture on Biclique Partition number of Split Graphs and related problems
by: Babu, Anand, et al.
Published: (2026)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part I: Theory
by: Warme, David M.
Published: (2024)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part II: Applications and Computational Evidence
by: Warme, David M.
Published: (2024)

On non-planar, cycle-conformal graphs
by: Gorsky, Maximilian, et al.
Published: (2026)

Computing distances is FPT on graph associahedra and W[2]-hard on hypergraphic polytopes
by: Cunha, Luís Felipe I., et al.
Published: (2025)

On the Importance of Studying the Membership Problem for Pedigree Polytopes
by: Arthanari, Tiru
Published: (2025)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
by: Rockel-Wolff, Benjamin
Published: (2024)

Edge and mixed metric dimension of Johnson graphs
by: Kratica, Jozef, et al.
Published: (2024)

Separating Matchings in Cubic Graphs
by: Gutiérrez, Juan, et al.
Published: (2026)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
by: Chimani, Markus, et al.
Published: (2021)

Local Equivalence Classes of Distance-Hereditary Graphs using Split Decompositions
by: Connolly, Nicholas, et al.
Published: (2026)

Efficient Preparation of Graph States using the Quotient-Augmented Strong Split Tree
by: Connolly, Nicholas, et al.
Published: (2026)

Polyhedral approach to weighted connected matchings in general graphs
by: Samer, Phillippe, et al.
Published: (2023)

Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
by: Ali, Alejandro Mata
Published: (2025)

Joint Pricing and Matching for Resource Allocation Platforms via Min-cost Flow Problem
by: Hikima, Yuya, et al.
Published: (2024)

On Grundy indices for complete geometric graphs
by: Lara, Dolores, et al.
Published: (2025)

On the Alon-Tarsi Number of Some Line and Total graphs
by: Prajnanaswaroopa, S.
Published: (2023)

Bounds on the genus for 2-cell embeddings of prefix-reversal graphs
by: Blanco, Saúl A., et al.
Published: (2023)

On problems in extremal multigraph theory
by: Falgas-Ravry, Victor, et al.
Published: (2025)

Monotonically Decreasing the Number of Directed 3-Cycles via Edge-Flips?
by: Bom, David, et al.
Published: (2025)

Geometrization of Graphs: Towards Bounding the Chromatic Number via High-Dimensional Embedding
by: Fang, Qiming, et al.
Published: (2024)

On the Metric Dimension of $K_a \times K_b \times K_c$
by: Gledel, Valentin, et al.
Published: (2024)

Bipartite Turán problem on cographs
by: Zimmermann, Jakob Paul
Published: (2026)

On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
by: Koutsoutis, Alex, et al.
Published: (2025)

A Proof of the Tree Packing Conjecture
by: Chalise, Parikshit, et al.
Published: (2024)

Tiling dense hypergraphs
by: Lang, Richard
Published: (2023)

A note on graphs with purely imaginary per-spectrum
by: Singh, Ranveer, et al.
Published: (2022)

A Row-wise Algorithm for Graph Realization
by: van der Hulst, Rolf, et al.
Published: (2024)

Edgewise Envelopes Between Balanced Forman and Ollivier-Ricci Curvature
by: Micaletto, Giorgio, et al.
Published: (2026)

A Combinatorial Framework for the Pons-Batle Identity: Young Tableaux, Lattice Paths, and Limit Laws
by: Liu, Hexuan, et al.
Published: (2026)

On 1-Konig-Egervary Graphs
by: Levit, Vadim E., et al.
Published: (2023)

Gallai's Path Decomposition for 2-degenerate Graphs
by: Anto, Nevil, et al.
Published: (2022)

Games on deBruijn Graphs and Cycle Means
by: Drenska, Nadejda
Published: (2026)

Bounds and Hardness Results for Conflict-free Choosability
by: Gupta, Shiwali, et al.
Published: (2024)

Action convergence of general hypergraphs and tensors
by: Zucal, Giulio
Published: (2023)

Graph Parameters, Universal Obstructions, and WQO
by: Paul, Christophe, et al.
Published: (2023)

Note on edge expansion and modularity in preferential attachment graphs
by: McDiarmid, Colin, et al.
Published: (2026)

New bounds on the modularity of $G(n,p)$
by: Rybarczyk, Katarzyna, et al.
Published: (2025)