Results 81 to 90 of about 120,363 (120)
Anti-Ramsey Number of Friendship Graphs
An edge-colored graph is called \textit{rainbow graph} if all the colors on its edges are distinct. For a given positive integer $n$ and a family of graphs $\mathcal{G}$, the anti-Ramsey number $ar(n, \mathcal{G})$ is the smallest number of colors $r$ required to ensure that, no matter how the edges of the complete graph $K_n$ are colored using exactly
Liu, Wenke, Lu, Hongliang, Luo, Xinyue
openaire +2 more sources
, 1979 Earl Ramsey sings and plays guitar in his Madison County home for a group of high school students from Paideia school in Atlanta.
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
, 1979 Earl Ramsey sings and plays guitar 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
Where Will I Shelter My Sheep Tonight
, 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
The planar Ramsey number PR(C4,K7)
, 2008 The planar Ramsey number PR(H1,H2) is the smallest integer n such that any planar graph on n vertices contains a copy of H1 or its complement contains a copy of H2. It is known that the Ramsey number R(C4,K7)=22. The planar Ramsey numbers PR(C4,Kl) for l≤
Yanan, Song +3 more
core +1 more source
The ith Ramsey number for matchings
, 1986 The ith Ramsey number for matchings is determined.
Powers, R.Glenn
core +1 more source
, 1979 Earl Ramsey sings and plays guitar in his Madison County home for a group of high school students from Paideia school in Atlanta.
Ramsey, Earl;
core
Irredundant and Mixed Ramsey Numbers
, 2013 The irredundant Ramsey number s(m n) is the smallest p such that in every two-coloring of the edges of K[subscript]p using colors red (R) and blue (B) either the blue subgraph contains an m-element irredundant set or the red subgraph contains an n ...
Clifton, Ann Wells +1 more
core
On Neutral Edge Sets in Anti-Ramsey Numbers
The anti-Ramsey number of a graph $G$, introduced by Erdős et al.\ in 1975, is the maximum number of colors in an edge-coloring of the complete graph $K_n$ that avoids a rainbow copy of $G$. We call a subset of edges of $G$ \emph{neutral} for the anti-Ramsey number if removing them does not alter the anti-Ramsey number of $G$.
Ghalavand, Ali +4 more
openaire +2 more sources