Results 11 to 20 of about 29,853 (260)
Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
, 2022 In 1973, Erdős conjectured the existence of high girth $(n,3,2)$-Steiner systems. Recently, Glock, Kühn, Lo, and Osthus and independently Bohman and Warnke proved the approximate version of Erdős' conjecture. Just this year, Kwan, Sah, Sawhney, and Simkin proved Erdős' conjecture.
Delcourt, Michelle, Postle, Luke
openaire +3 more sources
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.
Armen S. Asratian, Nikolai N. Kuzjurin
openaire +3 more sources
Fractional matching preclusion for butterfly derived networks
Theory and Applications of Graphs, 2019 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.
Xia Wang +4 more
doaj +3 more sources
Conditional Strong Matching Preclusion of the Alternating Group Graph
Theory and Applications of Graphs, 2019 The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings.
Mohamad Adballah, Eddie Cheng
doaj +3 more sources
A Stability Result for Almost Perfect Matchings
Journal of Graph TheoryABSTRACT Let be three integers and be a sufficiently small positive number such that , , and . A ‐graph is called non‐trivial if it has no isolated vertex. In this paper, we determine the maximum number of edges in a non‐trivial ‐graph with vertices and matching number at most .
Mingyang Guo, Hongliang Lu
openaire +3 more sources
Almost perfect matchings in random uniform hypergraphs
Discrete Mathematics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Krivelevich, Michael
openaire +2 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 +2 more sources
New bounds on the size of nearly perfect matchings in almost regular hypergraphs
Journal of the London Mathematical Society, 2023 AbstractLet be a ‐uniform ‐regular simple hypergraph on vertices. Based on an analysis of the Rödl nibble, in 1997, Alon, Kim and Spencer proved that if , then contains a matching covering all but at most vertices, and asked whether this bound is tight. In this paper we improve their bound by showing that for all , contains a matching covering all
Kang, Dong Yeap +3 more
openaire +4 more sources
An automated algorithm for the detection of cortical interruptions on high resolution peripheral quantitative computed tomography images of finger joints. [PDF]
PLoS ONE, 2017 To introduce a fully-automated algorithm for the detection of small cortical interruptions (≥0.246mm in diameter) on high resolution peripheral quantitative computed tomography (HR-pQCT) images, and to investigate the additional value of manual ...
M Peters +9 more
doaj +1 more source
The perfect family: decision making in biparental care. [PDF]
PLoS ONE, 2009 Previous theoretical work on parental decisions in biparental care has emphasized the role of the conflict between evolutionary interests of parents in these decisions. A prominent prediction from this work is that parents should compensate for decreases
Erol Akçay, Joan Roughgarden
doaj +1 more source