Zobrazeno 1 - 10
of 326
pro vyhledávání: '"Murphy, Kyle"'
Autor:
Murphy, Kyle R., Halford, Alexa J., Liu, Vivian, Klenzing, Jeffery, Smith, Jonathon, Garcia-Sage, Katherine, Pettit, Joshua, Rae, I. Jonathan
Atmospheric neutral density is a crucial component to accurately predict and track the motion of satellites. During periods of elevated solar and geomagnetic activity atmospheric neutral density becomes highly variable and dynamic. This variability a
Externí odkaz:
http://arxiv.org/abs/2407.00137
Autor:
Sivadas, Nithin, Sibeck, David, Subramanyan, Varsha, Walach, Maria-Theresia, Murphy, Kyle, Halford, Alexa
Extreme space weather events occur during intervals of strong solar wind electric fields. Curiously during these intervals, their impact on measures of the Earth's response, like the polar cap index, is not as high as expected. Theorists have put for
Externí odkaz:
http://arxiv.org/abs/2201.02137
Autor:
Murphy, Kyle R.1,2 kylemurphy.spacephys@gmail.com, Shoemaker, Michael A.3, Sibeck, David G.3, Schiff, Conrad3, Connor, Hyunju3, Porter, Fredrick S.3, Zesta, Eftyhia3, Vaidya, Bhargav, Upendran, Vishal
Publikováno v:
Frontiers in Astronomy & Space Sciences. 2024, p1-12. 12p.
Autor:
Murphy, Kyle, Nir, JD
The generalized Tur\'an problem $ext(n,T,F)$ is to determine the maximal number of copies of a graph $T$ that can exist in an $F$-free graph on $n$ vertices. Recently, Gerbner and Palmer noted that the solution to the generalized Tur\'an problem is o
Externí odkaz:
http://arxiv.org/abs/2102.00323
Autor:
Hawthorne, Benjamin C., Wellington, Ian J., Sabitsky, Joshua T., Murphy, Kyle V., Karsmarski, Owen P., Thomas, Rohin O., LeVasseur, Matthew R., Mancini, Michael R., Trudeau, Maxwell T., Gulati, Sagar, McCarthy, Mary Beth R., Cote, Mark P., Xu, Ming, Mazzocca, Augustus D.
Publikováno v:
In Arthroscopy: The Journal of Arthroscopic and Related Surgery January 2024 40(1):34-44
Publikováno v:
Graphs and Combinatorics 38(6), 180:1-180:33, 2022
Recently, Dvo\v{r}\'ak, Norin, and Postle introduced flexibility as an extension of list coloring on graphs [JGT 19']. In this new setting, each vertex $v$ in some subset of $V(G)$ has a request for a certain color $r(v)$ in its list of colors $L(v)$
Externí odkaz:
http://arxiv.org/abs/2009.07932
Autor:
Lidický, Bernard, Murphy, Kyle
The Erd\H{o}s Pentagon problem asks to find an $n$-vertex triangle-free graph that is maximizing the number of $5$-cycles. The problem was solved using flag algebras by Grzesik and independently by Hatami, Hladk\'{y}, Kr\'{a}l', Norin, and Razborov.
Externí odkaz:
http://arxiv.org/abs/2007.03064
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.