Results 151 to 160 of about 1,321,640 (205)
Some of the next articles are maybe not open access.
Nature Reviews Microbiology, 2020
A recent study investigated bacterial–fungal symbioses and found that fungal responses to bacteria differed depending on whether the relationship was mutualistic or antagonistic.
openaire +4 more sources
A recent study investigated bacterial–fungal symbioses and found that fungal responses to bacteria differed depending on whether the relationship was mutualistic or antagonistic.
openaire +4 more sources
Algorithms and Computation in Mathematics
Cláudio L. Lucchesi, U. S. R. Murty
semanticscholar +3 more sources
Cláudio L. Lucchesi, U. S. R. Murty
semanticscholar +3 more sources
Perfect Matchings in Random Sparsifications of Dirac Hypergraphs
Combinatorica, 2022For all integers n≥k>d≥1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document ...
D. Kang +4 more
semanticscholar +1 more source
The A-spectral radius and perfect matchings of graphs
Linear Algebra and its Applications, 2021Let α ∈ [ 0 , 1 ) , and let G be a graph of even order n with n ≥ f ( α ) , where f ( α ) = 10 for 0 ≤ α ≤ 1 / 2 , f ( α ) = 14 for 1 / 2 α ≤ 2 / 3 and f ( α ) = 5 / ( 1 − α ) for 2 / 3 α 1 . In this paper, it is shown that if the A α -spectral radius of
Yanhua Zhao, Xueyi Huang, Zhiwen Wang
semanticscholar +1 more source
Nature Reviews Chemistry, 2021
The kinetics of proton-coupled electron transfer during electrocatalytic oxygen reduction are optimized when hydrogen bonding between reaction intermediates and ionic liquids coating the catalyst is maximized.
openaire +2 more sources
The kinetics of proton-coupled electron transfer during electrocatalytic oxygen reduction are optimized when hydrogen bonding between reaction intermediates and ionic liquids coating the catalyst is maximized.
openaire +2 more sources
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
Proceedings of the 50th ACM Technical Symposium on Computer Science Education, 2019
With the massive growth of online learning, there has been a decrease in students' face-to-face interactions, leading to rising feelings of isolation. This in turn contributes to several issues such as motivation loss, increased course attrition rates and poor learning experiences.
Tam Nguyen Thanh +3 more
openaire +1 more source
With the massive growth of online learning, there has been a decrease in students' face-to-face interactions, leading to rising feelings of isolation. This in turn contributes to several issues such as motivation loss, increased course attrition rates and poor learning experiences.
Tam Nguyen Thanh +3 more
openaire +1 more source
Nature Materials, 2018
A metal–organic framework with tailored porosity provides a mixed matrix membrane with excellent performance for natural gas purification and butane isomer separation.
openaire +3 more sources
A metal–organic framework with tailored porosity provides a mixed matrix membrane with excellent performance for natural gas purification and butane isomer separation.
openaire +3 more sources
Nearly Perfect Matchings in Uniform Hypergraphs
SIAM Journal on Discrete Mathematics, 2019In this paper, we study degree conditions for the existence of large matchings in uniform hypergraphs. We prove that for integers $k,l,n$ with $k\ge 3$, $k/2 {n-l\choose k-l}-{(n-l)-(\lceil n/k \rceil-2)\choose 2}$, then $H$ has a matching covering all ...
Hongliang Lu, Xingxing Yu, Xiaofan Yuan
semanticscholar +1 more source
SIAM Review, 1970
Introduction. A graph G = {N, E} is taken to be a finite set of nodes N together with a set of distinct edges E which are unordered pairs of distinct nodes. A matching M of the graph is a subset of the edges E with the property that no two edges of M are incident at a node. A matching M is perfect if every node is incident to an edge of M.
openaire +1 more source
Introduction. A graph G = {N, E} is taken to be a finite set of nodes N together with a set of distinct edges E which are unordered pairs of distinct nodes. A matching M of the graph is a subset of the edges E with the property that no two edges of M are incident at a node. A matching M is perfect if every node is incident to an edge of M.
openaire +1 more source