Results 11 to 20 of about 120,363 (120)
The anti-Ramsey number of perfect matching
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ruth Haas, Michael Young
openaire +3 more sources
Online and size anti-Ramsey numbers [PDF]
Journal of Combinatorics, 2014 19 pages, 4 ...
Axenovich, Maria +3 more
openaire +5 more sources
Anti-Ramsey numbers for three classes of special subgraphs in wheel graph(轮图中三类特殊子图的anti-Ramsey数)
Zhejiang Daxue xuebao. Lixue banA subgraph in an edge-colored graph is called rainbow, if all its edges have different colors. Given two graphs G and H, the anti-Ramsey number for H in G, denoted by ar(G,H), is the maximum number of colors in an edge-coloring of G such that G contains ...
覃忠美(QIN Zhongmei) +2 more
doaj +2 more sources
The anti-Ramsey numbers of cliques in complete multi-partite graphs
Discrete MathematicsA subgraph of an edge-colored graph is rainbow if all of its edges have different colors. Let $G$ and $H$ be two graphs. The anti-Ramsey number $\ar(G, H)$ is the maximum number of colors of an edge-coloring of $G$ that does not contain a rainbow copy of $H$. In this paper, we study the anti-Ramsey numbers of $K_k$ in complete multi-partite graphs.
Ervin Gyori, Binlong Li
exaly +3 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 +7 more sources
Anti-Ramsey number of union of 5-path and matching
Discussiones Mathematicae Graph TheoryQing Jie, Zemin Jin
doaj +2 more sources
On Mf-Edge Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2022 An edge coloring φ of a graph G is called an Mf-edge coloring if | φ(v)| ≤ f(v) for every vertex v of G, where φ(v) is the set of colors of edges incident with v and f is a function which assigns a positive integer f(v) to each vertex v.
Ivančo Jaroslav, Onderko Alfréd
doaj +1 more source
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
Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems [PDF]
, 2013 This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M.
Wong, Wing Hong Tony
core +1 more source
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