Results 111 to 120 of about 1,525,761 (361)
Molecular Oncology, EarlyView.In prostate carcinoma, lactic acid, secreted by highly glycolytic cancer‐associated fibroblasts, is imported into tumor cells through the MCT1 transporter and prevents RSL3 and erastin‐induced ferroptosis (A). Targeting of carbonic anhydrase IX/XII, the main extracellular pH regulators, in tumor and stromal cells reduces microenvironmental acidosis and
Elisa Pardella +18 more
wiley +1 more source
Context-Sensitive Languages, Rational Graphs and Determinism [PDF]
Logical Methods in Computer Science, 2006 We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices.
Arnaud Carayol, Antoine Meyer
doaj +1 more source
Resolvent of Large Random Graphs
, 2009 We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and derive a new formula for the Stieljes transform of the spectral measure of such ...
Aldous +31 more
core +4 more sources
Discrete Mathematics, 1975 AbstractSome relations between the number of nodes and edges and the degrees of the nodes in infinite graphs are obtained. The structure of infinite connected graphs which have no- ∞ trails is investigated with the help of these. It is shown, for example, that any such graph G has |G| nodes of odd degree.
openaire +2 more sources
FEBS Open Bio, EarlyView.Stem cell‐based embryo models (SCBEMs) are valuable to study early developmental milestones. Matrigel, a basement membrane matrix, is a critical substrate used in various SCBEM protocols, but its role in driving stem cell lineage commitment is not clearly defined.
Atoosa Amel +3 more
wiley +1 more source
Journal of Combinatorial Theory, Series B, 1988 AbstractA general criterion is proved for a graph of any cardinality to possess a perfect matching. The criterion is used to prove an extension of Tutte's 1-factor theorem for general graphs.
openaire +2 more sources
Generating Infinite Random Graphs [PDF]
Proceedings of the Edinburgh Mathematical Society, 2018 AbstractWe define a growing model of random graphs. Given a sequence of non-negative integers {dn}n=0∞ with the property that di≤i, we construct a random graph on countably infinitely many vertices v0, v1… by the following process: vertex vi is connected to a subset of {v0, …, vi−1} of cardinality di chosen uniformly at random.
Csaba Biró, Udayan B. Darji
openaire +3 more sources
Semi‐automated hippocampal avoidance whole‐brain radiotherapy planning
Journal of Applied Clinical Medical Physics, EarlyView.Abstract Background Hippocampal avoidance whole‐brain radiotherapy (HA‐WBRT) is designed to spare cognitive function by reducing radiation dose to the hippocampus during the treatment of brain metastases. Current manual planning methods can be time‐consuming and may vary in quality, necessitating the development of automated approaches to streamline ...
Dong Joo Rhee +9 more
wiley +1 more source
Discrete Mathematics, 1978 AbstractWe strengthen a theorem of W.T. Trotter relating α-imperfect graphs to Suslin trees and derive several new results for infinite graphs with no chordless 4-cycles. We show that for such graphs G, (1) if G is χ-perfect then G is α-perfect, and (2) ΘG is at most the first cardinal beyond αG. We also indicate how Martin's axiom can be used to prove
openaire +2 more sources
Duality in Infinite Graphs [PDF]
Combinatorics, Probability and Computing, 2006 The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstructions fall away when duality is reinterpreted on the basis of a ‘singular’ approach to graph homology, whose cycles are defined topologically in a space formed by the graph ...
Henning Bruhn, Reinhard Diestel
openaire +2 more sources