Results 21 to 30 of about 7,928 (143)
Anti-Ramsey Numbers in Complete k-Partite Graphs [PDF]
Mathematical Problems in Engineering, 2020 The anti-Ramsey number ARG,H is the maximum number of colors in an edge-coloring of G such that G contains no rainbow subgraphs isomorphic to H. In this paper, we discuss the anti-Ramsey numbers ARKp1,p2,…,pk,Tn, ARKp1,p2,…,pk,ℳ, and ARKp1,p2,…,pk,C of Kp1,p2,…,pk, where Tn,ℳ, and C denote the family of all spanning trees, the family of all perfect ...
Jili Ding, Hong Bian, Haizheng Yu
openaire +1 more source
A SENTENÇA-RAMSEY, CARNAP E O REALISMO ESTRUTURAL
Polymatheia, 2021 O presente artigo tem duas pretensões básicas: (1) analisar a sentença-Ramsey, sobretudo a interpretação feita por Rudolf Carnap, mostrando qual o papel que ela desempenha no debate acerca do realismo e do anti-realismo científico; e (2) mostrar como ...
Marco Antônio Sousa Alves
doaj
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 +4 more
doaj +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
An Anti-Ramsey Condition on Trees [PDF]
The Electronic Journal of Combinatorics, 2008 Let $H$ be a finite tree. We consider trees $T$ such that if the edges of $T$ are colored so that no color occurs more than $b$ times, then $T$ has a subgraph isomorphic to $H$ in which no color is repeated. We will show that if $H$ falls into a few classes of trees, including those of diameter at most $4$, then the minimum value of $e(T)$ is provided
openaire +2 more sources
Online and size anti-Ramsey numbers [PDF]
Journal of Combinatorics, 2014 19 pages, 4 ...
Axenovich, Maria +3 more
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
The anti-Ramsey problem for the Sidon equation [PDF]
Discrete Mathematics, 2019 For $n \geq k \geq 4$, let $AR_{X + Y = Z + T}^k (n)$ be the maximum number of rainbow solutions to the Sidon equation $X+Y = Z + T$ over all $k$-colorings $c:[n] \rightarrow [k]$. It can be shown that the total number of solutions in $[n]$ to the Sidon equation is $n^3/12 + O(n^2)$ and so, trivially, $AR_{X+Y = Z + T}^k (n) \leq n^3 /12 + O (n^2)$. We
Vladislav Taranchuk, Craig Timmons
openaire +2 more sources