Results 61 to 70 of about 24,440 (246)

Infinite friendship graphs with infinite parameters

open access: yesJournal of Combinatorial Theory, Series B, 1991
We study infinite graphs in which every set of \(\kappa\) vertices has exactly \(\lambda\) common neighbours. We prove that there exist \(2^{\sigma}\) such graphs of each infinite order \(\sigma\) if \(\kappa\) is finite and that for \(\kappa\) infinite there are \(2^{\lambda}\) of them of order \(\lambda\) and none of cardinality greater than ...
Hahn, Geňa   +2 more
openaire   +2 more sources

Degree Sequences of Infinite Graphs [PDF]

open access: yesJournal of the London Mathematical Society, 1981
Peer Reviewed ; http://deepblue.lib.umich.edu/bitstream/2027.42/135582/1/jlms0010 ...
Blass, Andreas, Harary, Frank
openaire   +2 more sources

RIPK4 function interferes with melanoma cell adhesion and metastasis

open access: yesMolecular Oncology, EarlyView.
RIPK4 promotes melanoma growth and spread. RIPK4 levels increase as skin lesions progress to melanoma. CRISPR/Cas9‐mediated deletion of RIPK4 causes melanoma cells to form less compact spheroids, reduces their migratory and invasive abilities and limits tumour growth and dissemination in mouse models.
Norbert Wronski   +9 more
wiley   +1 more source

A Note on Pseudofinite Acyclic Graphs

open access: yesИзвестия Иркутского государственного университета: Серия "Математика"
Acyclic graphs approximated by finite acyclic graphs are considered. It is proved that any countably categorical acyclic graph is smoothly approximable. An example of pseudofinite acyclic graph theory is given, which has an even, odd, and infinite number
N. D. Markhabatov, Ye. R. Baissalov
doaj   +1 more source

Interrogating the immune landscape of microsatellite stable RAS‐mutated colon cancer

open access: yesMolecular Oncology, EarlyView.
COLOSSUS project RAS‐mutated MSS colon cancer study explored transcriptomics and immune cell density by immunohistochemistry (IHC), Immunoscore (IS), ISIC/TuLIS scores, mutation counts, and detected different prevalences but similar microenvironment composition across immune markers with clinical relevance for future immunotherapy combination ...
Rodrigo Dienstmann   +61 more
wiley   +1 more source

Mycobacterial cell division arrest and smooth‐to‐rough envelope transition using CRISPRi‐mediated genetic repression systems

open access: yesFEBS Open Bio, EarlyView.
CRISPRI‐mediated gene silencing and phenotypic exploration in nontuberculous mycobacteria. In this Research Protocol, we describe approaches to control, monitor, and quantitatively assess CRISPRI‐mediated gene silencing in M. smegmatis and M. abscessus model organisms.
Vanessa Point   +7 more
wiley   +1 more source

Menger’s theorem for infinite graphs [PDF]

open access: yesInventiones mathematicae, 2008
We prove that Menger's theorem is valid for infinite graphs, in the following strong form: let $A$ and $B$ be two sets of vertices in a possibly infinite digraph. Then there exist a set $\cp$ of disjoint $A$-$B$ paths, and a set $S$ of vertices separating $A$ from $B$, such that $S$ consists of a choice of precisely one vertex from each path in $\cp ...
Aharoni, Ron, Berger, Eli
openaire   +3 more sources

dUTPase is essential in zebrafish development and possesses several single‐nucleotide variants with pronounced structural and functional consequences

open access: yesFEBS Open Bio, EarlyView.
dUTPases are involved in balancing the appropriate nucleotide pools. We showed that dUTPase is essential for normal development in zebrafish. The different zebrafish genomes contain several single‐nucleotide variations (SNPs) of the dut gene. One of the dUTPase variants displayed drastically lower protein stability and catalytic efficiency as compared ...
Viktória Perey‐Simon   +6 more
wiley   +1 more source

The incidence chromatic number of some graph

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2005
The concept of the incidence chromatic number of a graph was introduced by Brualdi and Massey (1993). They conjectured that every graph G can be incidence colored with Δ(G)+2 colors.
Liu Xikui, Li Yan
doaj   +1 more source

Constructing Infinite One-regular Graphs

open access: yesEuropean Journal of Combinatorics, 1999
A graph \(X\) is said to be one-regular if the automorphism group of \(X\) acts regularly on the set of arcs of \(X\). The authors consider infinite one-regular graphs. Starting with an infinite family of finite one-regular graphs of valency 4, for each member of this family an infinite one-regular graph is constructed.
Malnič, Aleksander   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy