Geophysical Monograph Series, Page 1-26., 2021 Exploring the links between Large Igneous Provinces and dramatic environmental impact
An emerging consensus suggests that Large Igneous Provinces (LIPs) and Silicic LIPs (SLIPs) are a significant driver of dramatic global environmental and biological changes, including mass extinctions.
Richard E. Ernst +8 more
wiley +1 more source
Anti-Ramsey Numbers for Graphs with Independent Cycles [PDF]
The Electronic Journal of Combinatorics, 2009 An edge-colored graph is called rainbow if all the colors on its edges are distinct. Let ${\cal G}$ be a family of graphs. The anti-Ramsey number $AR(n,{\cal G})$ for ${\cal G}$, introduced by Erdős et al., is the maximum number of colors in an edge coloring of $K_n$ that has no rainbow copy of any graph in ${\cal G}$. In this paper, we determine the
Jin, Zemin, Li, Xueliang
openaire +2 more sources
Anti-Ramsey number of matchings in r-partite r-uniform hypergraphs [PDF]
Discrete Mathematics, 2022 12
Yisai Xue, Erfang Shan, Liying Kang
openaire +2 more sources
Anti-Ramsey number of union of 5-path and matching
Discussiones Mathematicae Graph TheoryQing Jie, Zemin Jin
doaj +2 more sources
Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs [PDF]
SIAM Journal on Discrete Mathematics, 2020 The anti-Ramsey problem was introduced by Erd s, Simonovits and S s in 1970s. The anti-Ramsey number of a hypergraph $\mathcal{H}$, $ar(n,s, \mathcal{H})$, is the smallest integer $c$ such that in any coloring of the edges of the $s$-uniform complete hypergraph on $n$ vertices with exactly $c$ colors, there is a copy of $\mathcal{H}$ whose edges have
Ran Gu, Jiaao Li, Yongtang Shi
openaire +2 more sources
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 ...
Gilboa, Shoni, Hefetz, Dan
openaire +2 more sources
Coherent manipulation of atomic qubits in optical micropotentials [PDF]
, 2007 We experimentally demonstrate the coherent manipulation of atomic states in far-detuned dipole traps and registers of dipole traps based on two-dimensional arrays of microlenses.
A. Kaplan +24 more
core +2 more sources
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 +5 more
openaire +6 more sources
Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs [PDF]
Applied Mathematics and Computation, 2022 Let $\mathcal{O}_n$ be the set of all maximal outerplanar graphs of order $n$. Let $ar(\mathcal{O}_n,F)$ denote the maximum positive integer $k$ such that $T\in \mathcal{O}_n$ has no rainbow subgraph $F$ under a $k$-edge-coloring of $T$. Denote by $M_k$ a matching of size $k$. In this paper, we prove that $ar(\mathcal{O}_n,M_k)\le n+4k-9$ for $n\ge3k-3$
Pei, Yifan, Lan, Yongxin, He, Hua
openaire +3 more sources
Approximating Maximum Edge 2-Coloring by Normalizing Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn 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 +4 more
doaj +1 more source