Noga Alon, Shmuel Friedland
We show that the number of perfect matching in a simple graph $G$ with an even number of vertices and degree sequence $d_1,d_2, ..., d_n$ is at most $\prod_{i=1}^n (d_i !)^{\frac{1}{2d_i}}$. This bound is sharp if and only if $G$ is a union of complete balanced bipartite graphs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
In this paper, we generalize the notions of perfect matchings, perfect 2-matchings to perfect k-matchings and give a necessary and sufficient condition for existence of perfect k-matchings. For bipartite graphs, we show that this k-matching problem is equivalent to that matching question. Moreover, for regular graphs, we provide a sufficient condition of perfect k-matching in terms of edge connectivity.
In this paper we give a proof that the largest set of perfect matchings, in which any two contain a common edge, is the set of all perfect matchings that contain a fixed edge. This is a version of the famous Erdős-Ko-Rado theorem for perfect matchings. The proof given in this paper is algebraic, we first determine the least eigenvalue of the perfect matching derangement graph and use properties of the perfect matching polytope. We also prove that the perfect matching derangement graph is not a Cayley graph.
In this paper, we prove that the 2-factor polynomial, an invariant of a planar trivalent graph with a perfect matching, counts the number of 2- factors that contain the the perfect matching as a subgraph. Consequently, we show that the polynomial detects even perfect matchings.
Suppose $k\nmid n$ and $H$ is an $n$-vertex $k$-uniform hypergraph. A near perfect matching in $H$ is a matching of size $\lfloor n/k\rfloor$. We give a divisibility barrier construction that prevents the existence of near perfect matchings in $H$. This generalizes the divisibility barrier for perfect matchings. We give a conjecture on the minimum $d$-degree threshold forcing a (near) perfect matching in $H$ which generalizes a well-known conjecture on perfect matchings. We also verify our conjecture in various cases. Our proof makes use of the lattice-based absorbing method that the author us…
On distribution of the depth index on perfect matchings
本文研究了完美匹配上深度指数的分布特性，揭示其与布雷特托 order 排名函数的等分布关系。
A perfect matching in the complete graph on $2k$ vertices is a set of edges such that no two edges have a vertex in common and every vertex is covered exactly once. Two perfect matchings are said to be $t$-intersecting if they have at least $t$ edges in common. The main result in this paper is an extension of the famous Erdős-Ko-Rado (EKR) theorem \cite{EKR} to 2-intersecting families of perfect matchings for all values of $k$. Specifically, for $k\geq 3$ a set of 2-intersecting perfect matchings in $K_{2k}$ of maximum size has $(2k-5)(2k-7)\cdots (1)$ perfect matchings.
We determine the \emph{exact} minimum $\ell$-degree threshold for perfect matchings in $k$-uniform hypergraphs when the corresponding threshold for perfect fractional matchings is significantly less than $\frac{1}{2} \binom{n}{k- \ell}$. This extends our previous results that determine the minimum $\ell$-degree thresholds for perfect matchings in $k$-uniform hypergraphs for all $\ell\ge k/2$ and provides two new (exact) thresholds: $(k,\ell)=(5,2)$ and $(7,3)$.
A perfect pseudo-matching M in a cubic graph G is a spanning subgraph of G such that every component of M is isomorphic to K_2 or to K_1,3. In view of snarks G with dominating cycle C, this is a natural generalization of perfect matchings since G-E(C) is a perfect pseudo-matching. Of special interest are such M where the graph G/M is planar because such G have a cycle double cover. We show that various well known classes of snarks contain planarizing perfect pseudo-matchings, and that there are at least as many snarks with planarizing perfect pseudo-matchings as there are cyclically 5-edge-con…
We show that every cubic bridgeless graph with n vertices has at least 3n/4-10 perfect matchings. This is the first bound that differs by more than a constant from the maximal dimension of the perfect matching polytope.
We show that each perfect matching in a bipartite graph $G$ intersects at least half of the perfect matchings in $G$. This result has equivalent formulations in terms of the permanent of the adjacency matrix of a graph, and in terms of derangements and permutations on graphs. We give several related results and open questions.
Let $T$ be a lobster with a matching that covers all but one vertex. We show that in this case, $T$ is graceful.
A Polyhedral Perspective on the Perfect Matching Lattice
本文利用多面体方法为匹配覆盖图的完美匹配格构造由完美匹配组成的格基，并通过奇割分解与 Birkhoff von Neumann 图给出构造性证明，建立完美匹配组合与几何性质的新联系。
In this note, we determine the maximum number of edges of a $k$-uniform hypergraph, $k\ge 3$, with a unique perfect matching. This settles a conjecture proposed by Snevily.
A note on colour-bias perfect matchings in hypergraphs
该研究将2着色图中保证显著色偏完美匹配存在的最小度阈值结果推广至k一致超图，确定了r着色k一致超图中对应最小ℓ度阈值。
Consider the family of all perfect matchings of the complete graph $K_{2n}$ with $2n$ vertices. Given any collection $\mathcal M$ of perfect matchings of size $s$, there exists a maximum number $f(n,x)$ such that if $s\leq f(n,x)$, then there exists a perfect matching that agrees with each perfect matching in $\mathcal M$ in at most $x-1$ edges. We use probabilistic arguments to give several lower bounds for $f(n,x)$. We also apply the Lovász local lemma to find a function $g(n,x)$ such that if each edge appears at most $g(n, x)$ times then there exists a perfect matching that agrees with each…
For each $b \geq 5$ we construct a pair of cospectral $b$-regular graphs, where one has a perfect matching and the other one not. This solves a research problem posed by the third author at the 22nd British Combinatorial Conference.
We present a simple and convenient analytical formula for efficient exact computation of the hafnian of Toeplitz matrices of a special type. An interpretation of the obtained results is given in the language of perfect matchings and Bessel polynomials.
Trees maximizing the number of almost-perfect matchings
本文刻画了最大化近乎完美匹配与强近乎完美匹配数量、并最小化极大匹配数量的极值树，并将结果用于加权 Hosoya 指数的极值问题。
We prove Ahlswede- Khachatrian conjecture. From this conjecture follows of several other conjectures including Manickam-Miklós-Singhi conjecture.
Distance spectral radius and perfect matchings in graphs with given fractional property
研究图在给定分数性质下，距离谱半径与完美匹配存在的关系，证明在特定条件下图存在完美匹配。
This paper has been withdrawn by the author(s), due an error in the proof.
A family of perfect matchings of $K_{2n}$ is $t$-$intersecting$ if any two members share $t$ or more edges. We prove for any $t \in \mathbb{N}$ that every $t$-intersecting family of perfect matchings has size no greater than $(2(n-t) - 1)!!$ for sufficiently large $n$, and that equality holds if and only if the family is composed of all perfect matchings that contain a fixed set of $t$ disjoint edges. This is an asymptotic version of a conjecture of Godsil and Meagher that can be seen as the non-bipartite analogue of the Deza-Frankl conjecture proven by Ellis, Friedgut, and Pilpel.
Perfect matchings in planar 3-connected graphs: girth five and minimum degree five
该论文回答了Goedgebeur等人关于平面3-连通图完美匹配的两个问题，构造了围长5且完美匹配数为常数的无限族图，还证明了最小度≥5的此类图的完美匹配数下界。
In this paper we investigate invertibility of graphs with a unique perfect matching, i.e. graphs having a unique 1-factor. We recall the new notion of the so-called negatively invertible graphs investigated by the authors in the recent paper. It is an extension of the classical definition of an inverse graph due to Godsil. We characterize all graphs with a unique perfect matching on $m\le 6$ vertices with respect to their positive and negative invertibility. We show that negatively invertible graphs exhibit properties like selfinvertibility which cannot be observed within the class of positive…
The forcing number of a perfect matching of a graph was introduced by Harary et al., which originated from Klein and Randić's ideal of innate degree of freedom of Kekulé structure in molecular graph. On the opposite side in some sense, Vukičević and Trinajstié proposed the anti-forcing number of a graph, afterwards Lei et al. generalized this idea to single perfect matching. Recently the forcing and anti-forcing polynomials of perfect matchings of a graph were proposed as counting polynomials for perfect matchings with the same forcing number and anti-forcing number respectively. In this paper…
The {\em perfect matching complex} of a graph is the simplicial complex on the edge set of the graph with facets corresponding to perfect matchings of the graph. This paper studies the perfect matching complexes, $\mathcal{M}_p(H_{k \times m\times n})$, of honeycomb graphs. For $k = 1$, $\mathcal{M}_p(H_{1\times m\times n})$ is contractible unless $n\ge m=2$, in which case it is homotopy equivalent to the $(n-1)$-sphere. Also, $\mathcal{M}_p(H_{2\times 2\times 2})$ is homotopy equivalent to the wedge of two 3-spheres. The proofs use discrete Morse theory.
Let G be a bridgeless cubic graph. A well-known conjecture of Berge and Fulkerson can be stated as follows: there exist five perfect matchings of G such that each edge of G is contained in at least one of them. Here, we prove that in each bridgeless cubic graph there exist five perfect matchings covering a portion of the edges at least equal to 215/231 . By a generalization of this result, we decrease the best known upper bound, expressed in terms of the size of the graph, for the number of perfect matchings needed to cover the edge-set of G.
The minimum co-degree threshold for a perfect matching in a $k$-graph with $n$ vertices was determined by Rödl, Ruciński and Szemerédi for the case when $n\equiv 0\pmod k$. Recently, Han resolved the remaining cases when $n \not\equiv 0\pmod k$, establishing a conjecture of Rödl, Ruciński and Szemerédi. In this paper, we determine the minimum co-degree threshold for almost perfect matchings in $k$-partite $k$-graphs, answering a question of Rödl and Ruciński.
The Perfect Matching Hamiltonian property in Prism and Crossed Prism graphs
本文研究了Prism图和Crossed Prism图的Perfect Matching Hamiltonian性质，证明了Prism图除Cube graph外均不满足该性质，并确定了Crossed Prism图满足该性质的参数条件。
We prove a new upper bound for the minimum $d$-degree threshold for perfect matchings in $k$-uniform hypergraphs when $d<k/2$. As a consequence, this determines exact values of the threshold when $0.42k \le d < k/2$ or when $(k,d)=(12,5)$ or $(17,7)$. Our approach is to give an upper bound on the Erdős Matching Conjecture and convert the result to the minimum $d$-degree setting by an approach of Kühn, Osthus and Townsend. To obtain exact thresholds, we also apply a result of Treglown and Zhao.
The number of perfect matchings in 3-connected planar graphs
研究可匹配的平面3-连通图中完美匹配数量，通过证明至少40个顶点的此类图至少有12个完美匹配且下界紧，否定了是否存在常数\(c<12\)使有无穷多此类图恰有\(c\)个完美匹配的问题。
An edge subset $S$ of a connected graph $G$ is called an anti-Kekulé set if $G-S$ is connected and has no perfect matching. We can see that a connected graph $G$ has no anti-Kekulé set if and only if each spanning tree of $G$ has a perfect matching. In this paper, by applying Tutte's 1-factor theorem and structure of minimally 2-connected graphs, we characterize all graphs whose each spanning tree has a perfect matching In addition, we show that if $G$ is a connected graph of order $2n$ for a positive integer $n\geq 4$ and size $m$ whose each spanning tree has a perfect matching, then $m\leq \…
We give a combinatorial intepretation of cluster variables of a specific cluster algebra under a mutation sequence of period 6, in terms of perfect matchings of subgraphs of the brane tiling dual to the quiver associated with the cluster algebra.
In this paper we provide a unified combinatorial approach to establish a connection between Stirling permutations, cycle structures of permutations and perfect matchings. The main tool of our investigations is MY-sequences. In particular, we discover that the Eulerian polynomials have a simple combinatorial interpretation in terms of some statistics on MY-sequences.
Lovasz and Plummer conjectured that there exists a fixed positive constant c such that every cubic n-vertex graph with no cutedge has at least 2^(cn) perfect matchings. Their conjecture has been verified for bipartite graphs by Voorhoeve and planar graphs by Chudnovsky and Seymour. We prove that every claw-free cubic n-vertex graph with no cutedge has more than 2^(n/12) perfect matchings, thus verifying the conjecture for claw-free graphs.
Let $n\ge 34$ be an even integer, and $D_n=2\lceil n/4 \rceil-1$. In this paper, we prove that every $\{D_n,\,D_n+1\}$-graph of order $n$ contains $\lceil n/4 \rceil$ disjoint perfect matchings. This result is sharp in the sense that (i) there exists a $\{D_n,\,D_n+1\}$-graph containing exactly $\lceil n/4 \rceil$ disjoint perfect matchings, and that (ii) there exists a $\{D_n-1,\,D_n\}$-graph without perfect matchings for each $n$. As a consequence, for any integer $D\ge D_n$, every $\{D,\,D+1\}$-graph of order $n$ contains $\lceil (D+1)/2 \rceil$ disjoint perfect matchings. This extends Csab…
A family of perfect matchings of $K_{2n}$ is $intersecting$ if any two of its members have an edge in common. It is known that if $\mathcal{F}$ is family of intersecting perfect matchings of $K_{2n}$, then $|\mathcal{F}| \leq (2n-3)!!$ and if equality holds, then $\mathcal{F} = \mathcal{F}_{ij}$ where $ \mathcal{F}_{ij}$ is the family of all perfect matchings of $K_{2n}$ that contain some fixed edge $ij$. In this note, we show that the extremal families are stable, namely, that for any $ε\in (0,1/\sqrt{e})$ and $n > n(ε)$, any intersecting family of perfect matchings of size greater than $(1 -…
The restricted hypercube-like graphs, variants of the hypercube, were proposed as desired interconnection networks of parallel systems. The matching preclusion number of a graph is the minimum number of edges whose deletion results in the graph with neither perfect matchings nor almost perfect matchings. The fractional perfect matching preclusion and fractional strong perfect matching preclusion are generalizations of the concept matching preclusion. In this paper, we obtain fractional matching preclusion number and fractional strong matching preclusion numbers of restricted hypercube-like gra…
Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with maximum degree four, for planar graphs with girth five, for bipartite five-regular graphs, for graphs of diameter three and for bipartite graphs of diameter four. We show that there exist polynomial time algorithms for the following classes of graphs: claw-free, $P_5$-free, diameter two, bipartite with diameter three and graphs with bounded tree-width.
Let $M$ be a perfect matching in a graph. A subset $S$ of $M$ is said to be a forcing set of $M$, if $M$ is the only perfect matching in the graph that contains $S$. The minimum size of a forcing set of $M$ is called the forcing number of $M$. Pachter and Kim [Discrete Math. 190 (1998) 287--294] conjectured that the forcing number of every perfect matching in the $n$-dimensional hypercube is at least $2^{n-2}$, for all $n \ge 2$. Riddle [Discrete Math. 245 (2002) 283-292] proved this for even $n$. We show that the conjecture holds for all $n \ge 2$. The proof is based on simple linear algebra.
Extending the notion of (random) $k$-out graphs, we consider when the $k$-out hypergraph is likely to have a perfect fractional matching. In particular, we show that for each $r$ there is a $k=k(r)$ such that the $k$-out $r$-uniform hypergraph on $n$ vertices has a perfect fractional matching with high probability (i.e., with probability tending to $1$ as $n\to \infty$) and prove an analogous result for $r$-uniform $r$-partite hypergraphs. This is based on a new notion of hypergraph expansion and the observation that sufficiently expansive hypergraphs admit perfect fractional matchings. As a f…
Given positive integers k\geq 3 and r where k/2 \leq r \leq k-1, we give a minimum r-degree condition that ensures a perfect matching in a k-uniform hypergraph. This condition is best possible and improves on work of Pikhurko who gave an asymptotically exact result. Our approach makes use of the absorbing method, and builds on work in 'Exact minimum degree thresholds for perfect matchings in uniform hypergraphs', where we proved the result for k divisible by 4.
This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are \emph{compatible} if they have the same vertex set and their union is also non-crossing. Our first result states that for any two perfect matchings $M$ and $M'$ of the same set of $n$ points, for some $k\in\Oh{\log n}$, there is a sequence of perfect matchings $M=M_0,M_1,...,M_k=M'$, such that each $M_i$ is compatible with $M_{i+1}$. This improves the previous best bound of $k\leq n-2$. We then study the conjecture: \emph{every perfect matching with an even number of edges has an edge-disjoint compatibl…
We derive a simple bijection between geometric plane perfect matchings on $2n$ points in convex position and triangulations on $n+2$ points in convex position. We then extend this bijection to monochromatic plane perfect matchings on periodically $k$-colored vertices and $(k+2)$-gonal tilings of convex point sets. These structures are related to a generalization of Temperley-Lieb algebras and our bijections provide explicit one-to-one relations between matchings and tilings. Moreover, for a given element of one class, the corresponding element of the other class can be computed in linear time.
Let $G$ be a bridgeless cubic graph. The Berge--Fulkerson Conjecture (1970s) states that $G$ admits a list of six perfect matchings such that each edge of $G$ belongs to exactly two of these perfect matchings. If answered in the affirmative, two other recent conjectures would also be true: the Fan--Raspaud Conjecture (1994), which states that $G$ admits three perfect matchings such that every edge of $G$ belongs to at most two of them; and a conjecture by Mazzuoccolo (2013), which states that $G$ admits two perfect matchings whose deletion yields a bipartite subgraph of $G$. It can be shown th…
Dong and Wang in [Theor. Comput. Sci. 771 (2019) 93--98] conjectured that the resulting graph of the $n$-dimensional folded hypercube $FQ_n$ by deleting any perfect matching is isomorphic to the hypercube $Q_n$. In this paper, we show that the conjecture holds when $n=2,3$, and it is not true for $n\geq4$.
We determine the minimum degree sum of two adjacent vertices that ensures a perfect matching in a 3-graph without isolated vertex. More precisely, suppose that $H$ is a 3-uniform hypergraph whose order $n$ is sufficiently large and divisible by $3$. If $H$ contains no isolated vertex and $deg(u)+ deg(v) > \frac{2}{3}n^2-\frac{8}{3}n+2$ for any two vertices $u$ and $v$ that are contained in some edge of $H$, then $H$ contains a perfect matching. This bound is tight.
The anti-forcing number of a perfect matching $M$ of a graph $G$ is the minimum number of edges of $G$ whose deletion results in a subgraph with a unique perfect matching $M$, denoted by $af(G,M)$. When $G$ is a plane bipartite graph, Lei et al. established a minimax result: For any perfect matching $M$ of $G$, $af(G,M)$ equals the maximum number of $M$-alternating cycles of $G$ where any two either are disjoint or intersect only at edges in $M$; For a hexagonal system, the maximum anti-forcing number equals the fries number. In this paper we show that for every perfect matching $M$ of a hexag…
In this paper we present a complete characterization of the smallest sets which block all the simple perfect matchings in a complete convex geometric graph on $2m$ vertices. In particular, we show that all these sets are caterpillar graphs with a special structure, and that their total number is $m \cdot 2^{m-1}$.
We study extremal type problem arising from the question: What is the maximum number of edge-disjoint non-crossing perfect matchings on a set S of 2n points in the plane such that their union is a triangle-free geometric graph? We approach this problem by considering four different situations of S. In particular, in the general position, we obtain (i) a sufficient condition for the existence of n edge-disjoint non-crossing perfect matchings in the general position whose union is a maximal triangle-free geometric graph, and (ii) a lower bound on the number of edge-disjoint non-crossing perfect …
We introduce the concept of matching connectivity as a notion of connectivity in graph admitting perfect matchings which heavily relies on the structural properties of those matchings. We generalise a result of Robertson, Seymour and Thomas for bipartite graphs with perfect matchings (see [Neil Roberts, Paul D Seymour, and Robin Thomas. Permanents, pfaffian orientations, and even directed curcuits. Annals of Mathematics, 150(2):929-975, 1999]) in order to obtain a concept of alternating paths that turns out to be sufficient for the description of our connectivity parameter. We introduce some b…
The determinant method of Kasteleyn gives a method of computing the number of perfect matchings of a planar bipartite graph. In addition, results of Bernardi exhibit a bijection between spanning trees of a planar bipartite graph and elements of its Jacobian. In this paper, we explore an analogue of Bernardi's results, providing a canonical simply transitive group action of the Kasteleyn cokernel of a planar bipartite graph on its set of perfect matchings, when the planar bipartite graph in question is of the form $G^+$, as defined by Kenyon, Propp and Wilson.
Lovász and Plummer conjectured, in the mid 1970's, that every cubic graph G with no cutedge has an exponential in |V(G)| number of perfect matchings. In this work we show that every cubic planar graph G whose geometric dual graph is a stack triangulation has at least 3 times the golden ratio to |V(G)|/72 distinct perfect matchings. Our work builds on a novel approach relating Lovász and Plummer's conjecture and the number of so called groundstates of the widely studied Ising model from statistical physics.
We show that Maker wins the Maker-Breaker perfect matching game in $\frac{n}{2}+o(n)$ turns when the bias is at least $\frac{n}{\log{n}}-\frac{f(n)n}{(\log{n})^{5/4}}$, for any $f$ going to infinity with $n$ and $n$ sufficiently large (in terms of $f$).
In this paper we prove an optimal co-degrees resilience property for the binomial $k$-uniform hypergraph model $H_{n,p}^k$ with respect to perfect matchings. That is, for a sufficiently large $n$ which is divisible by $k$, and $p\geq C_k\log_n/n$, we prove that with high probability every subgraph $H\subseteq H^k_{n,p}$ with minimum co-degree (meaning, the number of supersets every set of size $k-1$ is contained in) at least $(1/2+o(1))np$ contains a perfect matching.
Combinatorial connections in snake graphs: Tilings, lattice paths, and perfect matchings
本文引入三角蛇图，建立其路径、底层蛇图完美匹配与铺砌之间的双射，并据此给出直蛇图完美匹配数的 Hankel 行列式表达及 Fibonacci、Pell 序列的行列式来源。
A Novel Approach to Counting Perfect Matchings of Graphs
提出基于曲面相对上同调群的新方法计数图的完美匹配，并重新证明阿兹特克钻石定理，揭示交替符号矩阵的自然出现。
The number of perfect matchings in a brick
本文针对Lucchesi和Murty关于砖块中完美匹配数量的猜想，构造了一个无限砖块族，证明对于每个偶数n（n>17），存在包含n个顶点但仅有[0.625n]个完美匹配的砖块，从而推翻了该猜想。
We define the anti-forcing number of a perfect matching $M$ of a graph $G$ as the minimal number of edges of $G$ whose deletion results in a subgraph with a unique perfect matching $M$, denoted by $af(G,M)$. The anti-forcing number of a graph proposed by Vukičević and Trinajstić in Kekulé structures of molecular graphs is in fact the minimum anti-forcing number of perfect matchings. For plane bipartite graph $G$ with a perfect matching $M$, we obtain a minimax result: $af(G,M)$ equals the maximal number of $M$-alternating cycles of $G$ where any two either are disjoint or intersect only at edg…
The anti-forcing number of a perfect matching $M$ of a graph $G$ is the minimal number of edges not in $M$ whose removal to make $M$ as a unique perfect matching of the resulting graph. The set of anti-forcing numbers of all perfect matchings of $G$ is the anti-forcing spectrum of $G$. In this paper, we characterize the plane elementary bipartite graph whose minimum anti-forcing number is one. We show that the maximum anti-forcing number of a graph is at most its cyclomatic number. In particular, we characterize the graphs with the maximum anti-forcing number achieving the upper bound, such ex…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。