Results 191 to 200 of about 415,002 (218)
Some of the next articles are maybe not open access.
Erdős matching conjecture for almost perfect matchings
Discrete Mathematics, 2023In 1965 Erdő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 n<(s+1)(k+\frac{1}{100k})$.
Kolupaev, Dmitriy, Kupavskii, Andrey
openaire +1 more source
Waiting time problem for an almost perfect match
Statistics & Probability Letters, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Han, Qing, Hirano, Katuomi
openaire +1 more source
RELAX NG and DITA: An Almost Perfect Match
Balisage Series on Markup Technologies, 2014The DITA vocabulary architecture defines a formal and controlled mechanism for configuring and extending the base DITA vocabulary. The architecture is independent of any XML document grammar facility in that DITA only requires that document instances exhibit specific attributes that serve to declare the document's effective document type (set of ...
Eliot Kimber, George Bina
openaire +1 more source
Smallest close to regular bipartite graphs without an almost perfect matching
Acta Mathematica Sinica, English Series, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Volkmann, Lutz, Zingsem, Axel
openaire +1 more source
Almost fair perfect matchings in complete bipartite graphs
Discrete MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Othman, Abeer, Berger, Eli
openaire +2 more sources
Matching Methods in Valuation with Finite Cash Flows: An Almost Perfect Textbook Example
SSRN Electronic Journal, 2019In this note, we extend a numerical example in the textbook by Berk & DeMarzo that matches methods for only when KTS is equal to KD. We show that there is a generalized formulation for the return to levered equity KE that works for any value of KTS, the appropriate discount rate for the tax shield.
Joseph Tham, Ignacio Velez-Pareja
openaire +1 more source
The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree
2009In this paper we prove that the problem APM(k,r,c) of deciding whether a given k ?uniform hypergraph H, with minimum (k ? 1) ?wise vertex degree at least c|V(H)|, contains a matching missing exactly r vertices, that is, a set of disjoint edges of size at least (|V(H)| ?
openaire +1 more source
Critical raw materials partner Canada: an (almost) perfect match
SWP Comment 29 ...openaire +2 more sources
Multichannel Superposition of Grafted Perfect Vortex Beams
Advanced Materials, 2022Hammad Ahmed +2 more
exaly