Skip to search formSkip to main contentSkip to account menu

Ralph Faudree

Ralph Jasper Faudree (August 23, 1939 – January 13, 2015) was a mathematician, a professor of mathematics and the former provost of the University of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

2 relations
Erdős numberGraph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
On a Question of Erdös and Faudree on the Size Ramsey Numbers
For given simple graphs $G_1$ and $G_2$, the size Ramsey number $\hat{R}(G_1,G_2)$ is the smallest positive integer $m$, where… 
2016
2016
Terminal-Pairability in Complete Graphs
We investigate terminal-pairability properties of complete graphs and improve the known bounds in two open problems. We prove… 
2016
2016
Size Ramsey numbers of stars versus cliques
The size Ramsey number rˆ(G,H) of two graphs G and H is the smallest integer m such that there exists a graph F on m edges with… 
2015
2015
Generalized Pancyclic Properties in Claw-free Graphs
The property $$(k, m)$$(k,m)-pancyclicity, which generalizes the notion of a vertex pancyclic graph, was defined in Faudree et al… 
2015
2015
Ramsey Numbers of Trees Versus Odd Cycles
Burr, Erd\H{o}s, Faudree, Rousseau and Schelp initiated the study of Ramsey numbers of trees versus odd cycles, proving that $R… 
2013
2013
Independent cycles and chorded cycles in graphs
In this paper, we investigate sufficient conditions on the neighborhood of independent vertices which imply that a graph contains… 
2001
2001
Random Ramsey graphs for the four-cycle
It is shown that there is a graph 4 with n vertices and at least n ’ “edges such that it contains neither Ws nor X2 3 , but every… 
1998
1998
Irredundance perfect and P6-free graphs
The domination number γ(G) and the irredundance number ir(G) of a graph G have been considered by many authors. It is well known… 
1984
1984
A short proof for the Faudree-Schelp theorem on path-connected graphs
In this note a shortened proof is given for the Faudree—Schelp theorem on path-connected graphs. 
1978
1978
Counterexamples to faudree and schelp's conjecture on hamiltonian-connected graphs
Faudree and Schelp conjectured that for any two vertices x, y in a Hamiltonian-connected graph G and for any integer k, where n/2… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)