Results 91 to 100 of about 1,321,640 (205)

Matching Preclusion of the Generalized Petersen Graph

Theory and Applications of Graphs, 2019
The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph with no perfect matchings.
Ajay Arora, Eddie Cheng, Christopher Melekian   +2 more
doaj   +1 more source

Determinants and perfect matchings

Journal of Combinatorial Theory, Series A, 2013
15 pages, terminology improved, exposition tightened, "deranged matchings" example ...
openaire   +4 more sources

Perfect matchings and perfect squares

Journal of Combinatorial Theory, Series A, 1994
The author investigates (perfect) matchings of a large class of graphs with 4-fold rotational symmetry. It is proved by mostly combinatorial arguments that the number of such matchings is always a square or double a square. This result has an interesting application to tilings by dominoes.
openaire   +3 more sources

Trees and Matchings

, 1999
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed (and undirected)
Kenyon, Richard W., Propp, James G., Wilson, David B.   +2 more
core   +2 more sources

Perfect Matchings in the Semirandom Graph Process

SIAM Journal on Discrete Mathematics, 2022
Pu Gao, Calum MacRury, P. Prałat
semanticscholar   +1 more source

A Note on Perfect Matchings in Uniform Hypergraphs

Electronic Journal of Combinatorics, 2015
We determine the 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}\left( \begin{array}{c} n \\ k- \ell\end ...
Andrew Treglown, Yi Zhao
semanticscholar   +1 more source

Perfect Match

tanz
Der Online-Auftritt eines Unternehmens in Form einer Website ist in der heutigen Zeit von entscheidender Bedeutung. Allerdings genügt es nicht mehr, lediglich Bilder und Texte zu veröffentlichen. Ein zeitgemäßer Webauftritt erfordert eine herausragende User Experience sowie eine effektive Content Strategie.
openaire   +3 more sources

Genetic Algorithm for Finding the Global Forcing‎ ‎Number‎ ‎of‎ ‎Bipartite‎ ‎Graphs [PDF]

Mathematics Interdisciplinary Research
‎Consider a graph $G=(V(G),E(G))$‎, ‎where a perfect matching in $G$ is defined as a subset of independent edges with $\frac{|V(G)|}{2}$ elements‎. ‎A global forcing set is a subset $S$ of $E$ such that no two disjoint perfect matchings of $G$ coincide ...
Sara Oskoueian, Mostafa Tavakoli, Narjes Sabeghi   +2 more
doaj   +1 more source

Embedding large subgraphs into dense graphs

, 2009
What conditions ensure that a graph G contains some given spanning subgraph H? The most famous examples of results of this kind are probably Dirac's theorem on Hamilton cycles and Tutte's theorem on perfect matchings. Perfect matchings are generalized by
Kühn, Daniela, Osthus, Deryk
core   +1 more source

Commuting decomposition of Kn1,n2,...,nk through realization of the product A(G)A(GPk )

Special Matrices, 2018
In this paper, we introduce the notion of perfect matching property for a k-partition of vertex set of given graph. We consider nontrivial graphs G and GPk , the k-complement of graph G with respect to a kpartition of V(G), to prove that A(G)A(GPk ) is ...
Bhat K. Arathi, Sudhakara G.
doaj   +1 more source