Results 121 to 130 of about 10,152,062 (308)
The connected size Ramsey number for matchings versus small disconnected graphs
Let F, G, and H be simple graphs. The notation F → (G, H) means that if all the edges of F are arbitrarily colored by red or blue, then there always exists either a red subgraph G or a blue subgraph H.
Hilda Assiyatun +2 more
doaj +1 more source
Liver organoids: modelling complexity in homeostasis and disease
Studying liver in vitro has been challenging because simple 2D cell cultures fail to capture liver's cellular and architectural complexity. To bridge this gap, scientists increasingly use organoids, 3D liver models which better mimic liver composition and function. This review examines recent advances in liver organoid complexity and realism, discusses
Anna M. Dowbaj, Meritxell Huch
wiley +1 more source
The ith Ramsey number for matchings
Given graphs \(G_ 1,...,G_ k\) we denote by \(r_ i(G_ 1,...,G_ k)\) the least integer p so that, if the complete p-partite graph K(i,...,i) with each vertex set of size i has its edges colored with k colors, \(c_ 1,...,c_ k\), then, for some index j, there is a subgraph of K(i,...,i) isomorphic to \(G_ j\) with all of its edges colored \(c_ j\).
openaire +3 more sources
Connected size Ramsey numbers of matchings versus a small path or cycle
Given two graphs G1, G2, the connected size Ramsey number rc(G1, G2) is defined to be the minimum number of edges of a connected graph G, such that for any red-blue edge colouring of G, there is either a red copy of G1 or a blue copy of G2. Concentrating
Sha Wang +3 more
doaj +1 more source
This review focuses on the role of autophagy and mitophagy in maintaining pancreatic β‐cell function and homeostasis. We discuss how genetic defects affecting these pathways contribute to the development of type 1, type 2, monogenic, and gestational diabetes. We further explore their potential as therapeutic targets. Created in BioRender.
Yunkyeong Lee +2 more
wiley +1 more source
Graph Pattern Matching: From Intractable to Polynomial Time [PDF]
Graph pattern matching is typically defined in terms of sub-graph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often too restrictive to characterize patterns in emerging applications. We propose
Li, Jianzhong +5 more
core
Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry
EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri +5 more
wiley +1 more source
Matching with Trade-offs: Revealed Preferences over Competiting Characteristics [PDF]
We investigate in this paper the theory and econometrics of optimal matchings with competing criteria. The surplus from a marriage match, for instance, may depend both on the incomes and on the educations of the partners, as well as on characteristics ...
Alfred Galichon, Bernard Salanié
core
Tur\'an graphs with bounded matching number [PDF]
We determine the maximum possible number of edges of a graph with $n$ vertices, matching number at most $s$ and clique number at most $k$ for all admissible values of the ...
Alon, Noga, Frankl, Peter
core
Encapsulins are protein nanocompartments that play an important role in iron storage. In the Myxococcus xanthus encapsulin system, two cargo proteins called EncB and EncC contribute to iron mineralization. Here, we show that EncB and EncC generate iron‐containing minerals with distinct chemical compositions, suggesting that the composition of stored ...
Harry B. McDowell +2 more
wiley +1 more source

