Results 41 to 50 of about 407,618 (322)

Partitioning edge-coloured complete graphs into monochromatic cycles and paths

, 2012
A conjecture of Erd\H{o}s, Gy\'arf\'as, and Pyber says that in any edge-colouring of a complete graph with r colours, it is possible to cover all the vertices with r vertex-disjoint monochromatic cycles. So far, this conjecture has been proven only for r
Alexey Pokrovskiy, Allen, Ayel, Erdös, Gyárfás, Gyárfás, Gyárfás, Gyárfás, Gyárfás, Stéfane, Łuczak   +10 more
core   +1 more source

Monochromatic Path and Cycle Partitions in Hypergraphs [PDF]

The Electronic Journal of Combinatorics, 2013
Here we address the problem to partition edge colored hypergraphs by monochromatic paths and cycles generalizing a well-known similar problem for graphs.We show that $r$-colored $r$-uniform complete hypergraphs can be partitioned into monochromatic Berge-paths of distinct colors. Also, apart from $2k-5$ vertices, $2$-colored $k$-uniform hypergraphs can
Gyárfás, András, Sárközy, Gábor N.
openaire   +2 more sources

In vitro models of cancer‐associated fibroblast heterogeneity uncover subtype‐specific effects of CRISPR perturbations

Molecular Oncology, EarlyView.
Development of therapies targeting cancer‐associated fibroblasts (CAFs) necessitates preclinical model systems that faithfully represent CAF–tumor biology. We established an in vitro coculture system of patient‐derived pancreatic CAFs and tumor cell lines and demonstrated its recapitulation of primary CAF–tumor biology with single‐cell transcriptomics ...
Elysia Saputra, Shamsudheen Karuthedath Vellarikkal, Lixia Li, Hong Sun, Khoa Nguyen, Amber Montano, Suchitra Natarajan, Federica Piccioni, Alex Michael Tamburino, Xin Yu, Aleksandra Katarzyna Olow   +10 more
wiley   +1 more source

Edge magic total labeling of lexicographic product C4(2r+1) o ~K2 cycle with chords, unions of paths, and unions of cycles and paths

Indonesian Journal of Combinatorics, 2018
An edge magic total (EMT) labeling of a graph G = (V, E) is a bijection from the set of vertices and edges to a set of numbers defined by λ : V ∪ E → {1, 2, ..., ∣V∣ + ∣E∣} with the property that for every xy ∈ E, the weight of xy equals to a constant k,
Inne Singgih
doaj   +1 more source

Multicolor Ramsey Numbers for Paths and Cycles

Discussiones Mathematicae Graph Theory, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tomasz Dzido
openalex   +3 more sources

Revisiting Path Contraction and Cycle Contraction

Journal of Computer and System Sciences
The Path Contraction and Cycle Contraction problems take as input an undirected graph $G$ with $n$ vertices, $m$ edges and an integer $k$ and determine whether one can obtain a path or a cycle, respectively, by performing at most $k$ edge contractions in $G$. We revisit these NP-complete problems and prove the following results. Path Contraction admits
Krithika, R., Malu, V. K. Kutty, Tale, Prafullkumar   +2 more
openaire   +2 more sources

Turán problems and shadows I: Paths and cycles

Journal of Combinatorial Theory, Series A, 2015
A $k$-path is a hypergraph P_k = e_1,e_2,...,e_k such that |e_i \cap e_j| = 1 if |j - i| = 1 and e_i \cap e_j is empty otherwise. A k-cycle is a hypergraph C_k = e_1,e_2,.. ,e_k obtained from a (k-1)-path e_1,e_2,...,e_{k-1} by adding an edge e_k that shares one vertex with e_1, another vertex with e_{k-1} and is disjoint from the other edges. Let ex_r(
Kostochka, Alexandr, Mubayi, Dhruv, Verstraëte, Jacques   +2 more
openaire   +2 more sources

Effective therapeutic targeting of CTNNB1‐mutant hepatoblastoma with WNTinib

Molecular Oncology, EarlyView.
WNTinib, a Wnt/CTNNB1 inhibitor, was tested in hepatoblastoma (HB) experimental models. It delayed tumor growth and improved survival in CTNNB1‐mutant in vivo models. In organoids, WNTinib outperformed cisplatin and showed enhanced efficacy in combination therapy, supporting its potential as a targeted treatment for CTNNB1‐mutated HB.
Ugne Balaseviciute, Júlia Huguet‐Pradell, Jordi Abril‐Fornaguera, Albert Gris‐Oliver, Alex Rialdi, Elisa Fernández‐Martínez, Carla Montironi, Vanessa Del Pozo, Peter Houghton, Laura Zanatto, Agavni Mesropian, Ieva Keraite, Swan Thung, Carolina Armengol, Pau Sancho‐Bru, Ernesto Guccione, Roser Pinyol, Josep M. Llovet   +17 more
wiley   +1 more source

On-line Ramsey numbers of paths and cycles [PDF]

, 2014
Consider a game played on the edge set of the infinite clique by two players, Builder and Painter. In each round, Builder chooses an edge and Painter colours it red or blue. Builder wins by creating either a red copy of $G$ or a blue copy of $H$ for some
Cyman, Joanna, Dzido, Tomasz, Lapinskas, John, Lo, Allan   +3 more
core  

Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment

Molecular Oncology, EarlyView.
This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley   +1 more source