Results 51 to 60 of about 17,750 (263)
On Graphs with Ramsey-Infinite Blocks
European Journal of Combinatorics, 1985 We write \(F\to (G,H)\) if when the edges of the graph F are colored red and blue either the red subgraph contains a copy of the graph G or the blue subgraph contains a copy of H. Then F is (G,H)-minimal if \(F\to (G,H)\) but for every subgraph F' of F we have \(F'\nrightarrow (G,H)\).
Stefan A. Burr +2 more
openaire +2 more sources
Molecular Oncology, Volume 20, Issue 6, Page 1513-1534, June 2026.Nanosecond infrared laser (NIRL) low‐volume sampling combined with shotgun lipidomics uncovers distinct lipidome alterations in oropharyngeal squamous cell carcinoma (OPSCC) of the palatine tonsil. Several lipid species consistently differentiate tumor from healthy tissue, highlighting their potential as diagnostic markers.
Leonard Kerkhoff +11 more
wiley +1 more source
Pair L(2, 1)-Labelings of Infinite Graphs
Discussiones Mathematicae Graph Theory, 2019 An L(2, 1)-labeling of a graph G = (V,E) is an assignment of nonnegative integers to V such that two adjacent vertices must receive numbers (labels) at least two apart and further, if two vertices are in distance 2 then they receive distinct labels. This
Yeh Roger K.
doaj +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
Infinite Locally Random Graphs [PDF]
Internet Mathematics, 2006 Motivated by copying models of the web graph, Bonato and Janssen [Bonato and Janssen 03] introduced the following simple construction: given a graph G, for each vertex x and each subset X of its closed neighborhood, add a new vertex y whose neighbors are exactly X. Iterating this construction yields a limit graph ↑G. Bonato and Janssen claimed that the
Pierre Charbit, Alex D. Scott
openaire +3 more sources
Molecular Oncology, EarlyView.Aptamers are used both therapeutically and as targeting agents in cancer treatment. We developed an aptamer‐targeted PLGA–TRAIL nanosystem that exhibited superior therapeutic efficacy in NOD/SCID breast cancer models. This nanosystem represents a novel biotechnological drug candidate for suppressing resistance development in breast cancer.
Gulen Melike Demirbolat +8 more
wiley +1 more source
Reachability Analysis of Reversal-bounded Automata on Series-Parallel Graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Extensions to finite-state automata on strings, such as multi-head automata or multi-counter automata, have been successfully used to encode many infinite-state non-regular verification problems.
Rayna Dimitrova, Rupak Majumdar
doaj +1 more source
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
Molecular Oncology, EarlyView.Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson +9 more
wiley +1 more source
Unordered Love in infinite directed graphs
International Journal of Mathematics and Mathematical Sciences, 1992 A digraph D=(V,A) has the Unordered Love Property (ULP) if any two different vertices have a unique common outneighbor. If both (V,A) and (V,A−1) have the ULP, we say that D has the SDULP.
Peter D. Johnson
doaj +1 more source