Zobrazeno 1 - 10
of 415
pro vyhledávání: '"Tan, Jane"'
Autor:
Campbell, Rutger, Gollin, J. Pascal, Hendrey, Kevin, Lesgourgues, Thomas, Mohar, Bojan, Tamitegama, Youri, Tan, Jane, Wood, David R.
A colouring of a graph $G$ has clustering $k$ if the maximum number of vertices in a monochromatic component equals $k$. Motivated by recent results showing that many natural graph classes are subgraphs of the strong product of a graph with bounded t
Externí odkaz:
http://arxiv.org/abs/2407.21360
The $c$-strong chromatic number of a hypergraph is the smallest number of colours needed to colour its vertices so that every edge sees at least $c$ colours or is rainbow. We show that every $t$-intersecting hypergraph has bounded $(t + 1)$-strong ch
Externí odkaz:
http://arxiv.org/abs/2406.13402
For a graph $G$, the $k$-colouring graph of $G$ has vertices corresponding to proper $k$-colourings of $G$ and edges between colourings that differ at a single vertex. The graph supports the Glauber dynamics Markov chain for $k$-colourings, and has b
Externí odkaz:
http://arxiv.org/abs/2402.04237
The boundary rigidity problem is a classical question from Riemannian geometry: if $(M, g)$ is a Riemannian manifold with smooth boundary, is the geometry of $M$ determined up to isometry by the metric $d_g$ induced on the boundary $\partial M$? In t
Externí odkaz:
http://arxiv.org/abs/2309.04385
Autor:
Campbell, Rutger, Clinch, Katie, Distel, Marc, Gollin, J. Pascal, Hendrey, Kevin, Hickingbotham, Robert, Huynh, Tony, Illingworth, Freddie, Tamitegama, Youri, Tan, Jane, Wood, David R.
We show that many graphs with bounded treewidth can be described as subgraphs of the strong product of a graph with smaller treewidth and a bounded-size complete graph. To this end, define the "underlying treewidth" of a graph class $\mathcal{G}$ to
Externí odkaz:
http://arxiv.org/abs/2206.02395
Two boxes in $\mathbb{R}^d$ are comparable if one of them is a subset of a translation of the other one. The comparable box dimension of a graph $G$ is the minimum integer $d$ such that $G$ can be represented as a touching graph of comparable axis-al
Externí odkaz:
http://arxiv.org/abs/2203.07686
Autor:
Girão, António, Illingworth, Freddie, Powierski, Emil, Savery, Michael, Scott, Alex, Tamitegama, Youri, Tan, Jane
We prove that, for every graph $F$ with at least one edge, there is a constant $c_F$ such that there are graphs of arbitrarily large chromatic number and the same clique number as $F$ in which every $F$-free induced subgraph has chromatic number at m
Externí odkaz:
http://arxiv.org/abs/2203.03612
Publikováno v:
In European Journal of Combinatorics February 2025 124
Two permutations $s$ and $t$ are $k$-similar if they can be decomposed into subpermutations $s^1, \ldots, s^k$ and $t^1, \ldots, t^k$ such that $s^i$ is order-isomorphic to $t^i$ for all $i$. Recently, Dudek, Grytczuk and Ruci\'nski posed the problem
Externí odkaz:
http://arxiv.org/abs/2202.10789
Autor:
Prince, Jon B., Davis, Helen L., Tan, Jane, Muller-Townsend, Katrina, Markovic, Shaun, Lewis, David M.G., Hastie, Brianne, Thompson, Matthew B., Drummond, Peter D., Fujiyama, Hakuei, Sohrabi, Hamid R.
Publikováno v:
In Neuroscience and Biobehavioral Reviews June 2024 161