Results 51 to 60 of about 17,894 (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
From mice to humans—divergent strategies for intestinal homeostasis and regeneration
FEBS Letters, EarlyView.Recent advances such as organoid genome editing, xenotransplantation, imaging, and whole‐genome sequencing have enabled direct studies of human intestinal stem cells (ISCs). These studies reveal species‐specific features, including slower ISC proliferation, distinct injury responses, slower somatic mutation accumulation in humans, and an inverse ...
Keiko Ishikawa +2 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
Modelling stem cell differentiation related processes—A practical overview for biologists
FEBS Letters, EarlyView.Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source
Cycle Double Covers of Infinite Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 In this paper, we study the existence of cycle double covers for infinite planar graphs. We show that every infinite locally finite bridgeless k-indivisible graph with a 2-basis admits a cycle double cover.
Javaheri Mohammad
doaj +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
Design and analysis strategies for robust microbiome ageing research
FEBS Letters, EarlyView.The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
wiley +1 more source