Zobrazeno 1 - 10
of 94
pro vyhledávání: '"Andrew Thomason"'
Autor:
Sebastian Guelfi, Karishma D’Sa, Juan A. Botía, Jana Vandrovcova, Regina H. Reynolds, David Zhang, Daniah Trabzuni, Leonardo Collado-Torres, Andrew Thomason, Pedro Quijada Leyton, Sarah A. Gagliano Taliun, Mike A. Nalls, International Parkinson’s Disease Genomics Consortium (IPDGC), UK Brain Expression Consortium (UKBEC), Kerrin S. Small, Colin Smith, Adaikalavan Ramasamy, John Hardy, Michael E. Weale, Mina Ryten
Publikováno v:
Nature Communications, Vol 11, Iss 1, Pp 1-16 (2020)
Regulation of gene expression and splicing are thought to be tissue-specific. Here, the authors obtain genomic and transcriptomic data from putamen and substantia nigra of 117 neurologically healthy human brains and find that splicing eQTLs are enric
Externí odkaz:
https://doaj.org/article/d83bf92ed8ef48c8b17db5f5eae7d0d7
Autor:
Andrew Thomason, Matthew Wales
Publikováno v:
Journal of Graph Theory. 101:66-78
For a graph $H$, let $c(H)=\inf\{c\,:\,e(G)\geq c|G| \mbox{ implies } G\succ H\,\}$, where $G\succ H$ means that $H$ is a minor of $G$. We show that if $H$ has average degree $d$, then $$ c(H)\le (0.319\ldots+o_d(1))|H|\sqrt{\log d} $$ where $0.319\l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::592229ef1b6fbf5eff54a86d27e780f9
https://doi.org/10.1002/jgt.22811
https://doi.org/10.1002/jgt.22811
Let p be a prime, q be a power of p, and let Fq be the field of q elements. For any positive integer n, the Wenger graph Wn(q) is defined as follows: it is a bipartite graph with the vertex partitions being two copies of the (n+ 1)-dimensional vector
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ddd0f847fa5b072f3c22dda3ecbf4b55
Publikováno v:
The Electronic Journal of Combinatorics. 27
We show that for sufficiently large $d$ and for $t\geq d+1$, there is a graph $G$ with average degree $(1-\varepsilon)\lambda t \sqrt{\ln d}$ such that almost every graph $H$ with $t$ vertices and average degree $d$ is not a minor of $G$, where $\lam
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be2efe9d9904c179e9314073b791fcd2
https://doi.org/10.37236/8847
https://doi.org/10.37236/8847
Autor:
Pedro Quijada Leyton, Mina Ryten, Daniah Trabzuni, Andrew Thomason, John Hardy, Regina H. Reynolds, Sebastian Guelfi, Sarah A. Gagliano, Colin Smith, Adaikalavan Ramasamy, Jana Vandrovcova, Karishma D’Sa, Michael E. Weale, Kerrin S. Small, Leonoardo Collado-Torres, Mike A. Nalls, David Zhang, Juan A. Botía
Genome-wide association studies have generated an increasing number of common genetic variants that affect neurological and psychiatric disease risk. Given that many causal variants are likely to operate by regulating gene expression, an improved und
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::194ec15d9c8015251049870e7789bd73
https://doi.org/10.1101/591156
https://doi.org/10.1101/591156
Autor:
Andrew Thomason, Arès Méroueh
Let $\chi_l(G)$ denote the list chromatic number of the $r$-uniform hypergraph~$G$. Extending a result of Alon for graphs, Saxton and the second author used the method of containers to prove that, if $G$ is simple and $d$-regular, then $\chi_l(G)\ge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fb4eb255b208db73c23400c6de35e994
http://arxiv.org/abs/1704.07907
http://arxiv.org/abs/1704.07907
A weighting w of the edges of a graph G induces a colouring of the vertices of G where the colour of vertex v, denoted cv, is $${\sum\nolimits_{e \mathrel\backepsilon v} {w{\left( e \right)}} }$$. We show that the edges of every graph that does not c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d8730e808d32324cea260fa9cc7e515
https://doi.org/10.1007/s00493-007-0041-6
https://doi.org/10.1007/s00493-007-0041-6
Autor:
David Saxton, Andrew Thomason
We give an easy method for constructing containers for simple hypergraphs. Some applications are given; in particular, a very transparent calculation is offered for the number of H-free hypergraphs, where H is some fixed uniform hypergraph.
10 p
10 p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93b9cfbd03ee9fd4c810366ec4b59d05
https://www.repository.cam.ac.uk/handle/1810/267173
https://www.repository.cam.ac.uk/handle/1810/267173
Publikováno v:
Graphs and Combinatorics. 29:1269-1286
Motivated by the work of Anstee, Griggs, and Sali on forbidden submatrices and the extremal sat-function for graphs, we introduce sat-type problems for matrices. Let F be a family of k-row matrices. A matrix M is called F-admissible if M contains no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0b443b869aefbe6324fa5c067522850a
https://doi.org/10.1007/s00373-012-1199-2
https://doi.org/10.1007/s00373-012-1199-2
Autor:
David Saxton, Andrew Thomason
Publikováno v:
Combinatorics, Probability and Computing. 21:315-322
We show that the list chromatic number of a simpled-regularr-uniform hypergraph is at least (1/2rlog(2r2) +o(1)) logdifdis large.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3eb0ff82fc801c804f6df6e35203775d
https://doi.org/10.1017/s0963548311000502
https://doi.org/10.1017/s0963548311000502