Results 41 to 50 of about 2,022 (201)
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James Haglund, Jeffrey B. Remmel
openaire +2 more sources
International Journal of Mathematics and Mathematical Sciences, 1987 Explicit recurrences are derived for the matching polynomials of the basic types of hexagonal cacti, the linear cactus and the star cactus and also for an associated graph, called the hexagonal crown.
E. J. Farrell
doaj +1 more source
Classical Dimers on Penrose Tilings
Physical Review X, 2020 We study the classical dimer model on rhombic Penrose tilings, whose edges and vertices may be identified as those of a bipartite graph. We find that Penrose tilings do not admit perfect matchings (defect-free dimer coverings).
Felix Flicker +2 more
doaj +1 more source
Almost all Steiner triple systems are almost resolvable
Forum of Mathematics, Sigma, 2020 We show that for any n divisible by 3, almost all order-n Steiner triple systems admit a decomposition of almost all their triples into disjoint perfect matchings (that is, almost all Steiner triple systems are almost resolvable).
Asaf Ferber, Matthew Kwan
doaj +1 more source
Some perfect matchings and perfect half-integral matchings in NC
, 2008 We show that for any class of bipartite graphs which is closed under edge deletion and where the number of perfect matchings can be counted in NC, there is a deterministic NC algorithm for finding a perfect matching. In particular, a perfect matching can
Varadarajan, Kasturi R. +2 more
core +1 more source
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
Counting perfect matchings in n-extendable graphs
, 2008 The structural theory of matchings is used to establish lower bounds on the number of perfect matchings in n-extendable graphs. It is shown that any such graph on p vertices and q edges contains at least ⌈(n+1)!/4[q-p-(n-1)(2Δ-3)+4]⌉ different perfect ...
Došlić, Tomislav
core +1 more source
A note on perfect matchings in uniform hypergraphs with large minimum collective degree [PDF]
, 2006 summary:For an integer $k\ge2$ and a $k$-uniform hypergraph $H$, let $\delta_{k-1}(H)$ be the largest integer $d$ such that every $(k-1)$-element set of vertices of $H$ belongs to at least $d$ edges of $H$.
Schacht, Mathias +11 more
core +1 more source
A bound on the number of perfect matchings in Klee-graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Combinatorics
Marek Cygan +2 more
doaj +1 more source
A short proof of the toughness of Delaunay triangulations
Journal of Computational Geometry, 2021 We present a self-contained short proof of the seminal result of Dillencourt (SoCG 1987 and DCG 1990) that Delaunay triangulations, of planar point sets in general position, are 1-tough.
Ahmad Biniaz
doaj +1 more source