Results 91 to 100 of about 120,363 (120)
Where Will I Shelter My Sheep Tonight (talking)
, 1979 Earl Ramsey sings in his Madison County home for a group of high school students from Paideia school in Atlanta. The group is led by John Sundale.
Ramsey, Earl;
core
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
, 1979 Earl Ramsey talks in his Madison County home for a group of high school students from Paideia school in Atlanta. The group is led by John Sundale.
Ramsey, Earl;
core
, 1979 Earl Ramsey sings in his Madison County home for a group of high school students from Paideia school in Atlanta. The group is led by John Sundale.
Ramsey, Earl;
core
Hypergraph anti-Ramsey theorems
The anti-Ramsey number $\mathrm{ar}(n,F)$ of an $r$-graph $F$ is the minimum number of colors needed to color the complete $n$-vertex $r$-graph to ensure the existence of a rainbow copy of $F$.
Liu, Xizhi, Song, Jialei
core
The reports for 1857 and 1858 are published in one volume, with a common title-page and continuous pagination. The report for 1860 has cover-title "The anti-slavery history of the John-Brown year; being the twenty-seventh annual report of the American ...
American Anti-Slavery Society.
core
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Anti-Ramsey number of matchings in a hypergraph
Discrete Mathematics, 2021Given hypergraphs $\mathcal H$ and $\mathcal G$, the anti-Ramsey number $AR(\mathcal H, \mathcal G)$ is the greatest integer $c$ such that no $c$-coloring of the edges of $\mathcal H$ admits a copy of $\mathcal G$ whose edges (using that coloring) are all of distinct colors.
Zemin Jin
exaly +2 more sources
Anti-Ramsey Number of Triangles in Complete Multipartite Graphs
Graphs and Combinatorics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zemin Jin, Yuefang Sun, Sun Yuefang
exaly +2 more sources
Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs
Journal of Graph Theory, 2022AbstractFor an ‐graph , the anti‐Ramsey number is the minimum number of colors such that for any edge‐coloring of the complete ‐graph on vertices with at least colors, there is a copy of whose edges have distinct colors. Let and be the path and cycle with edges in 2‐graphs, respectively.
Yucong Tang, Guiying Yan
exaly +3 more sources