Zobrazeno 1 - 10
of 110
pro vyhledávání: '"Jeff Kahn"'
Autor:
Agata Ferretti, Marcello Ienca, Mark Sheehan, Alessandro Blasimme, Edward S. Dove, Bobbie Farsides, Phoebe Friesen, Jeff Kahn, Walter Karlen, Peter Kleist, S. Matthew Liao, Camille Nebeker, Gabrielle Samuel, Mahsa Shabani, Minerva Rivas Velarde, Effy Vayena
Publikováno v:
BMC Medical Ethics, Vol 22, Iss 1, Pp 1-13 (2021)
Abstract Background Ethics review is the process of assessing the ethics of research involving humans. The Ethics Review Committee (ERC) is the key oversight mechanism designated to ensure ethics review. Whether or not this governance mechanism is st
Externí odkaz:
https://doaj.org/article/70ddcc77999a449d9508f252e88b1b75
Autor:
Jeff Kahn
Publikováno v:
Transactions of the American Mathematical Society. 375:627-668
For fixed $r\geq 3$ and $n$ divisible by $r$, let ${\mathcal H}={\mathcal H}^r_{n,M}$ be the random $M$-edge $r$-graph on $V=\{1,\ldots ,n\}$; that is, ${\mathcal H}$ is chosen uniformly from the $M$-subsets of ${\mathcal K}:={V \choose r}$ ($:= \{\m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d4cfd73db2a86dac3f36d9c3d807434
https://doi.org/10.1090/tran/8508
https://doi.org/10.1090/tran/8508
Publikováno v:
Combinatorics, Probability and Computing. 30:899-904
A family of vectors $A \subset [k]^n$ is said to be intersecting if any two elements of $A$ agree on at least one coordinate. We prove, for fixed $k \ge 3$, that the size of a symmetric intersecting subfamily of $[k]^n$ is $o(k^n)$, which is in stark
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d4fde64e38e810a092e99b644129ac4
https://doi.org/10.1017/s0963548321000079
https://doi.org/10.1017/s0963548321000079
Publikováno v:
Oberwolfach Reports. 17:6-89
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57f0b28256581cbf605bc77c6660afb5
https://doi.org/10.4171/owr/2020/1
https://doi.org/10.4171/owr/2020/1
Publikováno v:
Annals of Mathematics. 194
Proving a conjecture of Talagrand, a fractional version of the 'expectation-threshold' conjecture of Kalai and the second author, we show for any increasing family $F$ on a finite set $X$ that $p_c (F) =O( q_f (F) \log \ell(F))$, where $p_c(F)$ and $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::35b3d20ce71e5af4690a48d7e86ae1bf
https://doi.org/10.4007/annals.2021.194.2.2
https://doi.org/10.4007/annals.2021.194.2.2
Autor:
Jeff Kahn, Arran Hamm
Publikováno v:
Combinatorics, Probability and Computing. 28:881-916
A family of sets is intersecting if no two of its members are disjoint, and has the Erdős–Ko–Rado property (or is EKR) if each of its largest intersecting subfamilies has non-empty intersection.Denote by ${{\cal H}_k}(n,p)$ the random family in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::342ab8d17ca0674d99c16e71ece91e14
https://doi.org/10.1017/s0963548319000117
https://doi.org/10.1017/s0963548319000117
We address a special case of a conjecture of M. Talagrand relating two notions of "threshold" for an increasing family $\mathcal F$ of subsets of a finite set $V$. The full conjecture implies equivalence of the "Fractional Expectation-Threshold Conje
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dbc91b18fe1f2c6fea1c6de5ffce14f9
Autor:
Jinyoung Park, Jeff Kahn
A celebrated conjecture of Zs. Tuza says that in any (finite) graph, the minimum size of a cover of triangles by edges is at most twice the maximum size of a set of edge-disjoint triangles. Resolving a recent question of Bennett, Dudek, and Zerbib, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::82889181a4485e3675b08a514c5a1a59
http://arxiv.org/abs/2007.04351
http://arxiv.org/abs/2007.04351
Resolving a conjecture of K\"uhn and Osthus from 2012, we show that $p= 1/\sqrt{n}$ is the threshold for the random graph $G_{n,p}$ to contain the square of a Hamilton cycle.
Comment: 6 pages
Comment: 6 pages
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c33b928cb377e9c6798aa334146c449b
Autor:
Jacob D. Baron, Jeff Kahn
Publikováno v:
Random Structures & Algorithms. 54:39-68
Write $\mathcal{C}(G)$ for the cycle space of a graph $G$, $\mathcal{C}_\kappa(G)$ for the subspace of $\mathcal{C}(G)$ spanned by the copies of the $\kappa$-cycle $C_\kappa$ in $G$, $\mathcal{T}_\kappa$ for the class of graphs satisfying $\mathcal{C
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3cfe050bcb59d8742ca07ab8d0a5956a
https://doi.org/10.1002/rsa.20785
https://doi.org/10.1002/rsa.20785