Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1902.01322

Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs

Meike Hatzel·Roman Rabinovich·Sebastian Wiederrecht
View original source ↗Read source document ↗Export metadata ↓

Abstract

A connected graph G is called matching covered if every edge of G is contained in a perfect matching. Perfect matching width is a width parameter for matching covered graphs based on a branch decomposition. It was introduced by Norine and intended as a tool for the structural study of matching covered graphs, especially in the context of Pfaffian orientations. Norine conjectured that graphs of high perfect matching width would contain a large grid as a matching minor, similar to the result on treewidth by Robertson and Seymour. In this paper we obtain the first results on perfect matching width since its introduction. For the restricted case of bipartite graphs, we show that perfect matching width is equivalent to directed treewidth and thus the Directed Grid Theorem by Kawarabayashi and Kreutzer for directed \treewidth implies Norine's conjecture.

Explore related subjects

math.COcs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht. 2019-02-14. Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs. https://arxiv.org/abs/1902.01322

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Analytic expressions pertaining to certain arithmetical functions

We demonstrate the general outlines of a method for obtaining analytic expressions for certain types of general arithmetical sums. In particular, analytical expressions for a general arithmetical sum whose terms are summed over either the positive integer solutions $(a,b)$ of the Diophantine equation $kb^2+da^2 = N$ or the positive integer solutions $(a,b)$ of the Diophantine equation $kb^2-da^2 = N$ are derived.

math.CO↗
arXiv2026

Minimum degree and sparse connected spanning subgraphs

Let $G$ be a connected graph on $n$ vertices and at most $n(1+ε)$ edges with bounded maximum degree, and $F$ a graph on $n$ vertices with minimum degree at least $n-k$, where $ε$ is a constant depending on $k$. In this paper, we prove that $F$ contains $G$ as a spanning subgraph provided $n\ge 6k^3$, by establishing tight bounds for the Ramsey number $r(G,K_{1,k})$, where $K_{1,k}$ is a star on $k+1$ vertices. Our result generalizes and refines the work of Erdős, Faudree, Rousseau, and Schelp (JCT-B, 1982), who established the corresponding result for $G$ being a tree. Moreover, the tight bound for $r(G,tK_{1,k})$ is also obtained.

math.CO↗
arXiv2026

Edge-spectral Turán theorems for color-critical graphs with applications

A classical result of Nosal asserts that every $m$-edge graph with spectral radius $λ(G)> \sqrt{m}$ contains a triangle. A celebrated extension of Nikiforov [2002, CPC] states that if $G$ is an $m$-edge graph with $λ(G)> \sqrt{(1- {1}/{r})2m}$, then $G$ contains a clique $K_{r+1}$. This result implies the Turán theorem and Wilf theorem, and offers a new perspective on the existence of substructures. The edge-spectral conditions are versatile for enforcing substructures, as they can be applied to any sparse graph regardless of its edge density. In this paper, we prove that for any color-critical graph $F$ with chromatic number $χ(F)=r+1\ge 4$, if $m$ is sufficiently large and $G$ is an $F$-free graph with $m$ edges, then $λ(G)\le \sqrt{(1- {1}/{r})2m}$, with equality if and only if $G$ is a regular complete $r$-partite graph. This settles an open problem proposed by Yu and Li [2025, arXiv] and also gives spectral bounds for graphs forbidding books and wheels. Secondly, we establish an asymptotic formula and structural characterization when we forbid an almost-bipartite graph $F$, where $F$ is called almost-bipartite if it can be made bipartite by removing at most one edge. As applications, we determine the unique $m$-edge spectral extremal graph for every integer $m$ when avoiding certain substructures, including complete bipartite graphs plus an edge, cycles plus an edge, and theta graphs, etc. Our results resolve an open problem proposed by Li, Zhao and Zou [2025, JGT], as well as two conjectures posed by Liu and Li [2025, LAA]. The arguments in our proofs are based on the edge-spectral stability method recently established by the authors. In addition, we develop some new spectral techniques, including the stability result for the Perron--Frobenius eigenvector.

math.CO↗