Zobrazeno 1 - 10
of 33 638
pro vyhledávání: '"McCarty A"'
We disprove the conjecture of Georgakopoulos and Papasoglu that a length space (or graph) with no $K$-fat $H$ minor is quasi-isometric to a graph with no $H$ minor. Our counterexample is furthermore not quasi-isometric to a graph with no 2-fat $H$ mi
Externí odkaz:
http://arxiv.org/abs/2405.09383
Autor:
Abrishami, Tara, Briański, Marcin, Czyżewska, Jadwiga, McCarty, Rose, Milanič, Martin, Rzążewski, Paweł, Walczak, Bartosz
When $\mathcal{T}$ is a tree decomposition of a graph $G$, we write $\mu(\mathcal{T})$ for the maximum size of an induced matching in $G$ all of whose edges intersect one bag of $\mathcal{T}$. The induced matching treewidth of a graph $G$ is the mini
Externí odkaz:
http://arxiv.org/abs/2405.04617
Autor:
Gajarský, Jakub, McCarty, Rose
Graph classes of bounded tree rank were introduced recently in the context of the model checking problem for first-order logic of graphs. These graph classes are a common generalization of graph classes of bounded degree and bounded treedepth, and th
Externí odkaz:
http://arxiv.org/abs/2404.18904
Autor:
Saad-Falcon, Alex, Bolding, Mark, Dee, James, Westafer, Ryan S., Denison, Douglas R., McCarty, Nael, Hunt, William D.
The cystic fibrosis transmembrane conductance regulator (CFTR) is an important membrane protein in vertebrates. The function of CFTR is to transport chloride ions across the cell membrane, which is known to require adenosine triphosphate (ATP). Where
Externí odkaz:
http://arxiv.org/abs/2404.09281
Autor:
Du, Xiying, McCarty, Rose
If a graph has no large balanced bicliques, but has large minimum degree, then what can we say about its induced subgraphs? This question motivates the study of degree-boundedness, which is like $\chi$-boundedness but for minimum degree instead of ch
Externí odkaz:
http://arxiv.org/abs/2403.05737
A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an $\mathcal{H}$-universal gr
Externí odkaz:
http://arxiv.org/abs/2311.05500
The total face color polynomial is based upon the Poincar\'{e} polynomials of a family of filtered $n$-color homologies. It counts the number of $n$-face colorings of ribbon graphs for each positive integer $n$. As such, it may be seen as a successor
Externí odkaz:
http://arxiv.org/abs/2308.02732
We give two extensions of the recent theorem of the first author that the odd distance graph has unbounded chromatic number. The first is that for any non-constant polynomial $f$ with integer coefficients and positive leading coefficient, every finit
Externí odkaz:
http://arxiv.org/abs/2308.02483
Autor:
McCarty, Rose
We prove a precise min-max theorem for the following problem. Let $G$ be an Eulerian graph with a specified set of edges $S \subseteq E(G)$, and let $b$ be a vertex of $G$. Then what is the maximum integer $k$ so that the edge-set of $G$ can be parti
Externí odkaz:
http://arxiv.org/abs/2308.01456
Autor:
Carolyn A. McCarty, Tayler Hennings, Chuan Zhou, Emily F. Law, Douglas Zatzick, Sara P. D. Chrisman
Publikováno v:
Trials, Vol 25, Iss 1, Pp 1-16 (2024)
Abstract Background Up to 1.9 million youth in the USA sustain a concussion each year, and up to 30% experience persistent post-concussive symptoms (PPCS) lasting 1 month or more. PPCS can substantially interfere with social, emotional, and academic
Externí odkaz:
https://doaj.org/article/a16d2e7ca0e34eb0bfebb9ddd7829217