Zobrazeno 1 - 10
of 2 118
pro vyhledávání: '"McKay, A. D."'
Autor:
Angeltveit, Vigleik, McKay, Brendan D.
We prove that the Ramsey number $R(5,5)$ is less than or equal to~$46$. The proof uses a combination of linear programming and checking a large number of cases by computer. All of the computations were independently replicated.
Externí odkaz:
http://arxiv.org/abs/2409.15709
The logarithm of the number of Eulerian orientations, scaled by the number of vertices, is known as the residual entropy in studies of ice-type models on graphs. The spanning tree entropy depends similarly on the number of spanning trees. We demonstr
Externí odkaz:
http://arxiv.org/abs/2409.04989
Autor:
Camp, Heidi Van den, McKay, Brendan D.
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 26:3, Discrete Algorithms (November 15, 2024) dmtcs:13080
Lopsp-operations are operations on maps that are applied locally and are guaranteed to preserve all the orientation-preserving symmetries of maps. Well-known examples of such operations are dual, ambo, truncation, and leapfrog. They are described by
Externí odkaz:
http://arxiv.org/abs/2402.10676
An Eulerian orientation is an orientation of the edges of a graph such that every vertex is balanced: its in-degree equals its out-degree. Counting Eulerian orientations corresponds to the crucial partition function in so-called ``ice-type models'' i
Externí odkaz:
http://arxiv.org/abs/2309.15473
We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices tends to inf
Externí odkaz:
http://arxiv.org/abs/2309.00190
We enumerate factorisations of the complete bipartite graph into spanning semiregular graphs in several cases, including when the degrees of all the factors except one or two are small. The resulting asymptotic behaviour is seen to generalise the num
Externí odkaz:
http://arxiv.org/abs/2206.12793
We enumerate factorisations of the complete graph into spanning regular graphs in several cases, including when the degrees of all the factors except for one or two are small. The resulting asymptotic behaviour is seen to generalise the number of reg
Externí odkaz:
http://arxiv.org/abs/2206.12792
Autor:
McKay, Brendan D., Peters, Tim
Consider $n$ points evenly spaced on a circle, and a path of $n-1$ chords that uses each point once. There are $m=\lfloor n/2\rfloor$ possible chord lengths, so the path defines a multiset of $n-1$ elements drawn from $\{1,2,\ldots,m\}$. The first pr
Externí odkaz:
http://arxiv.org/abs/2205.06004
Autor:
Kim, Suel-Kee 1, 2, 16, Seo, Seungmae 1, 16, Stein-O’Brien, Genevieve 1, 16, Jaishankar, Amritha 1, 16, Ogawa, Kazuya 1, Micali, Nicola 1, 2, Luria, Victor 2, 4, 5, Karger, Amir 6, Wang, Yanhong 1, Kim, Hyojin 2, Hyde, Thomas M. 1, 8, 10, Kleinman, Joel E. 1, 8, Voss, Ty 13, Fertig, Elana J. 9, Shin, Joo-Heon 1, Bürli, Roland 14, Cross, Alan J. 14, Brandon, Nicholas J. 14, Weinberger, Daniel R. 1, 8, 10, 11, 12, Chenoweth, Joshua G. 1, Hoeppner, Daniel J. 1, Sestan, Nenad 2, 3, ∗, Colantuoni, Carlo 1, 8, 11, 15, ∗∗, McKay, Ronald D. 1, 7, 17, ∗∗∗
Publikováno v:
In Stem Cell Reports 10 September 2024 19(9):1336-1350
Autor:
Petroselli, C. a, b, 1, Williams, K.A. a, c, 1, Ruiz, S.A. a, 1, McKay Fletcher, D. a, e, 1, Cooper, M.J. d, Roose, T. a, ⁎
Publikováno v:
In Soil Biology and Biochemistry July 2024 194