Results 231 to 240 of about 29,853 (260)

Erdős matching conjecture for almost perfect matchings

Discrete Mathematics, 2023
In 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})$.
Andrey Kupavskii
exaly   +2 more sources

Smallest close to regular bipartite graphs without an almost perfect matching

Acta Mathematica Sinica, English Series, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lutz Volkmann, Volkmann Lutz
exaly   +2 more sources

Strong matching preclusion

Theoretical Computer Science, 2011
The matching preclusion problem, introduced by Brigham et al. [R.C. Brigham, F. Harary, E.C. Violin, and J. Yellen, Perfect-matching preclusion, Congressus Numerantium 174 (2005) 185–192], studies how to effectively make a graph have neither perfect ...
Jung-Heum Park, Insung Ihm
exaly   +2 more sources

Matching preclusion for k-ary n-cubes

Discrete Applied Mathematics, 2010
The (conditional) matching preclusion number of a graph is the minimum number of edges whose deletion leaves a resulting graph (with no isolated vertices) that has neither perfect matchings nor almost perfect matchings.
Shiying Wang, Ruixia Wang, Shangwei Lin   +2 more
exaly   +2 more sources

Waiting time problem for an almost perfect match

Statistics & Probability Letters, 2003
zbMATH 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, 2014
The 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

Almost fair perfect matchings in complete bipartite graphs

Discrete Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abeer Othman, Eli Berger
openaire   +2 more sources