Results 41 to 50 of about 29,700 (214)
The Colouring Number of Infinite Graphs [PDF]
We show that, given an infinite cardinal $ $, a graph has colouring number at most $ $ if and only if it contains neither of two types of subgraph. We also show that every graph with infinite colouring number has a well-ordering of its vertices that simultaneously witnesses its colouring number and its cardinality.
Johannes Carmesin+3 more
openaire +3 more sources
TGF‐β has a complex role in cancer, exhibiting both tumor‐suppressive and tumor‐promoting properties. Using a series of differentiated tumoroids, derived from different stages and mutational background of colorectal cancer patients, we replicate this duality of TGF‐β in vitro. Notably, the atypical but highly aggressive KRASQ22K mutation rendered early‐
Theresia Mair+17 more
wiley +1 more source
Chronic TGF‐β exposure drives epithelial HCC cells from a senescent state to a TGF‐β resistant mesenchymal phenotype. This transition is characterized by the loss of Smad3‐mediated signaling, escape from senescence, enhanced invasiveness and metastatic potential, and upregulation of key resistance modulators such as MARK1 and GRM8, ultimately promoting
Minenur Kalyoncu+11 more
wiley +1 more source
Dual targeting of AKT and mTOR using MK2206 and RAD001 reduces tumor burden in an intracardiac colon cancer circulating tumor cell xenotransplantation model. Analysis of AKT isoform‐specific knockdowns in CTC‐MCC‐41 reveals differentially regulated proteins and phospho‐proteins by liquid chromatography coupled mass spectrometry. Circulating tumor cells
Daniel J. Smit+19 more
wiley +1 more source
Monochromatic cycle partitions in local edge colourings [PDF]
An edge colouring of a graph is said to be an $r$-local colouring if the edges incident to any vertex are coloured with at most $r$ colours. Generalising a result of Bessy and Thomass\'e, we prove that the vertex set of any $2$-locally coloured complete ...
Conlon, David, Stein, Maya
core +1 more source
Local colourings and monochromatic partitions in complete bipartite graphs
We show that for any $2$-local colouring of the edges of the balanced complete bipartite graph $K_{n,n}$, its vertices can be covered with at most~$3$ disjoint monochromatic paths.
Lang, Richard, Stein, Maya
core +1 more source
This article advocates integrating temporal dynamics into cancer research. Rather than relying on static snapshots, researchers should increasingly consider adopting dynamic methods—such as live imaging, temporal omics, and liquid biopsies—to track how tumors evolve over time.
Gautier Follain+3 more
wiley +1 more source
Colouring random geometric graphs [PDF]
A random geometric graph $G_n$ is obtained as follows. We take $X_1, X_2, \ldots, X_n ∈\mathbb{R}^d$ at random (i.i.d. according to some probability distribution ν on $\mathbb{R}^d$). For $i ≠j$ we join $X_i$ and $X_j$ by an edge if $║X_i - X_j ║< r(n)$. We study the properties of the chromatic number $χ _n$ and clique number $ω _n$ of this graph as
Colin McDiarmid, Tobias Müller
openaire +5 more sources
Inhibitor of DNA binding‐1 is a key regulator of cancer cell vasculogenic mimicry
Elevated expression of transcriptional regulator inhibitor of DNA binding 1 (ID1) promoted cancer cell‐mediated vasculogenic mimicry (VM) through regulation of pro‐angiogenic and pro‐cancerous genes (e.g. VE‐cadherin (CDH5), TIE2, MMP9, DKK1). Higher ID1 expression also increased metastases to the lung and the liver.
Emma J. Thompson+11 more
wiley +1 more source
Edge-colourings of graphs [PDF]
All the results in this thesis are concerned with the classification of graphs by their chromatic class. We first extend earlier results of Fiorini and others to give a complete list of critical graphs of order at most ten. We give conditions for extending the edge-colouring of a nearly complete subgraph to the whole graph and use this result to prove ...
openaire +2 more sources