Results 11 to 20 of about 415,002 (218)
On the number of nearly perfect matchings in almost regular uniform hypergraphs
Discrete Mathematics, 1999 \textit{N. Pippenger} and \textit{J. Spencer} [J. Comb. Theory, Ser. A 51, No. 1, 24-42 (1989; Zbl 0729.05038)] showed the existence of a nearly perfect matching in almost regular uniform hypergraphs satisfying certain conditions. \textit{D. A. Grable} and \textit{K. T. Phelps} [J. Comb. Des. 4, No.
Asratian, A.S., Kuzjurin, N.N.
openaire +2 more sources
Polynomial-time perfect matchings in dense hypergraphs [PDF]
, 2013 Let $H$ be a $k$-graph on $n$ vertices, with minimum codegree at least $n/k + cn$ for some fixed $c > 0$. In this paper we construct a polynomial-time algorithm which finds either a perfect matching in $H$ or a certificate that none exists.
Keevash, Peter +2 more
core +2 more sources
Almost perfect matchings in random uniform hypergraphs
Discrete Mathematics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Matching Preclusion and Conditional Matching Preclusion Problems for Twisted Cubes [PDF]
, 2010 The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced
Bhaskar, Ram +4 more
core
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs [PDF]
, 2008 We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolation lemma as described in (Mulmuley et al.
Datta, Samir +2 more
core +7 more sources
Erd\H{o}s Matching Conjecture for almost perfect matchings
, 2022 In 1965 Erd\H{o}s asked, what is the largest size of a family of $k$-element subsets of an $n$-element set that does not have a matching of size $s+1$? In this note, we improve upon a recent result of Frankl and resolve this problem for $s>101k^{3}$ and $(s+1)k\le ...
Kolupaev, Dmitriy, Kupavskii, Andrey
openaire +1 more source
Molecular Oncology, EarlyView.This study shows that copy number variations (CNVs) can be reliably detected in formalin‐fixed paraffin‐embedded (FFPE) solid cancer samples using ultra‐low‐pass whole‐genome sequencing, provided that key (pre)‐analytical parameters are optimized.
Hanne Goris +10 more
wiley +1 more source
Trees maximizing the number of almost-perfect matchings
Applicable Analysis and Discrete MathematicsWe characterize the extremal trees that maximize the number of almost- perfect matchings, which are matchings covering all but one or two vertices, and those that maximize the number of strong almost-perfect matchings, which are matchings missing only one or two leaves. We also determine the trees that minimize the number of maximal matchings. We apply
Cambie, Stijn +4 more
openaire +2 more sources
FEBS Open Bio, EarlyView.Amino acids sequence of two different proteins with the same sequence (chameleon sequence—black boxes) represent in 3D structure of the proteins different secondary structures: HHHH—helical and BBB—Beta‐structural. The chains folded in water environment adopt different III‐order structures in which the chameleon fragments appear to adopt similar status
Irena Roterman +4 more
wiley +1 more source
Rainbow Matchings: existence and counting
, 2011 A perfect matching M in an edge-colored complete bipartite graph K_{n,n} is rainbow if no pair of edges in M have the same color. We obtain asymptotic enumeration results for the number of rainbow matchings in terms of the maximum number of occurrences ...
Perarnau, Guillem, Serra, Oriol
core +1 more source