Results 71 to 80 of about 120,363 (120)

Four Nights Drunk (talking)

, 1979
Earl Ramsey talks in his Madison County home with a group of high school students from Paideia school in Atlanta. The group is led by John Sundale.
Ramsey, Earl;
core  

When They Toll the Bells of Heaven

, 1979
Earl Ramsey plays guitar and sings in his Madison County home with two women, Trisha and ?, for a group of high school students from Paideia school in Atlanta.
Ramsey, Earl;
core  

A note on the Ramsey number and the planar Ramsey number for C₄ and complete graphs

, 1999
We give a lower bound for the Ramsey number and the planar Ramsey number for C₄ and complete graphs. We prove that the Ramsey number for C₄ and K₇ is 21 or 22.
Bielak, Halina
core   +1 more source

Anti-Ramsey number of intersecting cliques

An edge-colored graph is called a rainbow graph if all its edges have distinct colors. The anti-Ramsey number $ar(n, G)$, for a graph $G$ and a positive integer $n$, is defined as the minimum number of colors $r$ such that every exact $r$-edge-coloring of the complete graph $K_n$ contains at least one rainbow copy of $G$. A $(k, r)$-fan graph, denoted $
Lu, Hongliang, Luo, Xinyue, Ma, Xinxin
openaire   +2 more sources

Anti-Ramsey Numbers of Loose Paths and Cycles in Uniform Hypergraphs

Graphs and Combinatorics
For a fixed family of $r$-uniform hypergraphs $\mathcal{F}$, the anti-Ramsey number of $\mathcal{F}$, denoted by $ ar(n,r,\mathcal{F})$, is the minimum number $c$ of colors such that for any edge-coloring of the complete $r$-uniform hypergraph on $n$ vertices with at least $c$ colors, there is a rainbow copy of some hypergraph in $\mathcal{F}$. Here, a
Tong Li, Yucong Tang, Guanghui Wang 0002, Guiying Yan   +3 more
openaire   +3 more sources

Nobody Answered Me

, 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  

Stability for the Anti-Ramsey Number of Matchings

Let $n, r, s$ be three positive integers such that $n\geq 2s+5$. Let $K_r$ denote the complete graph of order $r$. Given a graph $F$, the anti-Ramsey number $ar(n,F)$ is defined as the minimum number $C$ such that any edge-coloring of $K_n$ with exactly $C$ colors contains a rainbow copy of $F$.
Zhang, Xuechun, Lu, Hongliang
openaire   +2 more sources

Cross in the Garden, The

, 1979
Earl Ramsey plays guitar and sings in his Madison County home with two women, Trisha and ?, for a group of high school students from Paideia school in Atlanta.
Ramsey, Earl;
core  

The connected Ramsey number

, 1978
A graph G is totally connected if both G and Ḡ (its complement) are connected. The connected Ramsey number rc(F, H) is the smallest integer k ⩾ 4 so that if G is a totally connected graph of order k then either F ⊂ G or H ⊂ Ḡ.
Sumner, David P.
core   +1 more source

In the Bible We Read of a City

, 1979
Earl Ramsey talks and sings in his Madison County home for a group of high school students from Paideia school in Atlanta.
Ramsey, Earl;
core