Results 21 to 30 of about 1,483,849 (194)

Entanglement-based 3D magnetic gradiometry with an ultracold atomic scattering halo

New Journal of Physics, 2020
Ultracold collisions of Bose–Einstein condensates can be used to generate a large number of counter-propagating pairs of entangled atoms, which collectively form a thin spherical shell in momentum space, called a scattering halo.
D K Shin, J A Ross, B M Henson, S S Hodgman, A G Truscott   +4 more
doaj   +1 more source

Anti-Ramsey problems on graphs and hypergraphs

, 2022
The Tur\'{a}n number for a graph $H$ is the least possible number of edges on an $n$-vertex graph with no copy of $H$ as a subgraph. For graphs $G$ and $H$, the \emph{anti-Ramsey number}, denoted $\ar(G,H)$, is the minimum number of colors $d$ such that
Sprangel, Elizabeth Ann
core   +1 more source

Edge Colorings of K(m,n) with m+n-1 Colors Which Forbid Rainbow Cycles

Theory and Applications of Graphs, 2017
For positive integers m, n, the greatest number of colors that can appear in an edge coloring of K(m,n) which avoids rainbow cycles is m + n - 1. Here these colorings are constructively characterized.
Peter Johnson, Claire Zhang
doaj   +1 more source

A quasi-regularist view of laws

Principia: An International Journal of Epistemology, 2019
It will be analyzed some views about laws and highlight certain aspects in each of them that, in our opinion, are to the detriment of their plausibility.
Nélida Gentile
doaj   +1 more source

On degree anti-Ramsey numbers

European Journal of Combinatorics, 2017
The degree anti-Ramsey number $AR_d(H)$ of a graph $H$ is the smallest integer $k$ for which there exists a graph $G$ with maximum degree at most $k$ such that any proper edge colouring of $G$ yields a rainbow copy of $H$. In this paper we prove a general upper bound on degree anti-Ramsey numbers, determine the precise value of the degree anti-Ramsey ...
Shoni Gilboa, Dan Hefetz
openaire   +2 more sources

Pragmatisms and Logical Empiricisms: Response to Misak and Klein

Journal for the History of Analytical Philosophy, 2016
This paper responds to the generous comments by Alexander Klein and Cheryl Misak on my “American Pragmatism and the Vienna Circle: The Early Years”. First, besides offering some clarification of my original thesis, I argue that Jerusalem was not liable ...
Thomas Uebel
doaj   +1 more source

Anti-Ramsey Colorings in Several Rounds

Journal of Combinatorial Theory, Series B, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Blokhuis, A., Faudree, R., Gyárfás, A., Ruszinkó, M.   +3 more
openaire   +1 more source

Complexity of Computing the Anti-Ramsey Numbers for Paths

Theoretical Computer Science, 2023
The anti-Ramsey numbers are a fundamental notion in graph theory, introduced in 1978, by Erd\" os, Simonovits and S\' os. For given graphs $G$ and $H$ the \emph{anti-Ramsey number} $\textrm{ar}(G,H)$ is defined to be the maximum number $k$ such that there exists an assignment of $k$ colors to the edges of $G$ in which every copy of $H$ in $G$ has at ...
Saeed Akhoondian Amiri, Alexandru Popa 0001, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, Hossein Vahidi 0001   +5 more
openaire   +6 more sources

Approximating Maximum Edge 2-Coloring by Normalizing Graphs [PDF]

Discrete Mathematics & Theoretical Computer Science
In a simple, undirected graph G, an edge 2-coloring is a coloring of the edges such that no vertex is incident to edges with more than 2 distinct colors.
Tobias Mömke, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze   +4 more
doaj   +1 more source

Almost-Rainbow Edge-Colorings of Some Small Subgraphs

Discussiones Mathematicae Graph Theory, 2013
Let f(n, p, q) be the minimum number of colors necessary to color the edges of Kn so that every Kp is at least q-colored. We improve current bounds on these nearly “anti-Ramsey” numbers, first studied by Erdös and Gyárfás.
Krop Elliot, Krop Irina
doaj   +1 more source