Results 211 to 220 of about 167,102 (266)
Efficient near-telomere-to-telomere assembly of nanopore simplex reads. [PDF]
NatureCheng H +7 more
europepmc +1 more source
Maximum persistent Betti numbers of Čech complexes. [PDF]
J Appl Comput TopolEdelsbrunner H, Kahle M, Kanazawa S.
europepmc +1 more source
Neonatal Varicella-Zoster Virus Meningitis Without Pleocytosis: Diagnostic Value of Polymerase Chain Reaction. [PDF]
CureusBoulfouyoul A, Ettoini K, Oulmaati A.
europepmc +1 more source
An Enhanced Black-Winged Kite Algorithm with Multiple Strategies for Global Optimization and Constrained Engineering Applications. [PDF]
Biomimetics (Basel)Du C, Zhang J, Fang J.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Combinatorics, Probability and Computing, 2009
A d-simplex is a collection of d + 1 sets such that every d of them has non-empty intersection and the intersection of all of them is empty. Fix k ≥ d + 2 ≥ 3 and let be a family of k-element subsets of an n-element set that contains no d-simplex. We prove that if $|\cG| \geq (1 - o(1))\binom{n-1 }{k-1}$, then there is a vertex x of such that the ...
Dhruv Mubayi, Reshma Ramadurai
openaire +1 more source
A d-simplex is a collection of d + 1 sets such that every d of them has non-empty intersection and the intersection of all of them is empty. Fix k ≥ d + 2 ≥ 3 and let be a family of k-element subsets of an n-element set that contains no d-simplex. We prove that if $|\cG| \geq (1 - o(1))\binom{n-1 }{k-1}$, then there is a vertex x of such that the ...
Dhruv Mubayi, Reshma Ramadurai
openaire +1 more source