Results 71 to 80 of about 91,419 (162)
Anti-Ramsey numbers in complete split graphs
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Ontology After Folk Psychology; or, Why Eliminativists Should Be Mental Fictionalists
Analytic Philosophy, Volume 67, Issue 1, Page 1-11, March 2026.ABSTRACT Mental fictionalism holds that folk psychology should be regarded as a kind of fiction. The present version gives a Lewisian prefix semantics for mentalistic discourse, where roughly, a mentalistic sentence “p” is true iff “p” is deducible from the folk psychological fiction.
Ted Parent
wiley +1 more source
The Journal of Physiology, Volume 604, Issue 5, Page 2302-2335, 1 March 2026.Abstract figure legend Overview of the study design and workflow. Left: screening for RhBG mutations associated with chronic kidney disease. Right: functional validation of identified mutations using Xenopus oocyte electrophysiology with two‐electrode voltage clamp technique and intracellular pH measurements, showing impairment of NH3/NH4+ transport ...
He Zhou +3 more
wiley +1 more source
Access to telecommunications networks [PDF]
telecommunication;telecommunication industry;networks;access to market;policy;allocation ...
Bijl, P. de, Canoy, M., Kemp, R.
core +1 more source
On Neutral Edge Sets in Anti-Ramsey Numbers
The anti-Ramsey number of a graph $G$, introduced by Erdős et al.\ in 1975, is the maximum number of colors in an edge-coloring of the complete graph $K_n$ that avoids a rainbow copy of $G$. We call a subset of edges of $G$ \emph{neutral} for the anti-Ramsey number if removing them does not alter the anti-Ramsey number of $G$.
Ghalavand, Ali +4 more
openaire +2 more sources
Anti-Ramsey Numbers of Loose Paths and Cycles in Uniform Hypergraphs
Graphs and CombinatoricsFor a fixed family of $r$-uniform hypergraphs $\mathcal{F}$, the anti-Ramsey number of $\mathcal{F}$, denoted by $ ar(n,r,\mathcal{F})$, is the minimum number $c$ of colors such that for any edge-coloring of the complete $r$-uniform hypergraph on $n$ vertices with at least $c$ colors, there is a rainbow copy of some hypergraph in $\mathcal{F}$. Here, a
Li, Tong +3 more
openaire +3 more sources
On the Anti-Ramsey Number Under Edge Deletion
According to a study by Erdős et al. in 1975, the anti-Ramsey number of a graph \(G\), denoted as \(AR(n, G)\), is defined as the maximum number of colors that can be used in an edge-coloring of the complete graph \(K_n\) without creating a rainbow copy of \(G\).
Ghalavand, Ali +4 more
openaire +2 more sources
Anti-Ramsey Number of Stars in 3-uniform hypergraphs
An edge-colored hypergraph is called \emph{a rainbow hypergraph} if all the colors on its edges are distinct. Given two positive integers $n,r$ and an $r$-uniform hypergraph $\mathcal{G}$, the anti-Ramsey number $ar_r(n,\mathcal{G})$ is defined to be the minimum number of colors $t$ such that there exists a rainbow copy of $\mathcal{G}$ in any exactly $
Lu, Hongliang, Luo, Xinyue, Ma, Xinxin
openaire +2 more sources
New Bounds on the Anti-Ramsey Number of Independent Triangles
An edge-colored graph is called \textit{rainbow graph} if all the colors on its edges are distinct. Given a positive integer $n$ and a graph $G$, the \textit{anti-Ramsey number} $ar(n,G)$ is defined to be the minimum number of colors $r$ such that there exists a rainbow copy of $G$ in any exactly $r$-edge-coloring of $K_n$. Wu et al.
Lu, Hongliang, Luo, Xinyue, Ma, Xinxin
openaire +2 more sources
A Perspective on Understanding Transient Stimulated Raman Scattering Spectroscopy with Ramsey Interferometry. [PDF]
Chem Biomed ImagingHuang Y, Li Y, Li N, Wang P.
europepmc +1 more source