AbstractFor i = 1, 2, … , k, let Gi be a graph with vertex set [n] = {1,…,n} containing no Fi as a subgraph. At most how many edges are in G1 ∪ ··· ∪ Gk? We shall answer this Turán-Ramsey-type question asymptotically, and pose a number of related problems
We show that for any graph G with N vertices and average degree d, if the average degree of any neig...
We study two problems in graph Ramsey theory. In the early 1970s, Erdős and O'Neil considered a...
Fix positive integers p and q with 2 ≤ q ≤ (p2). An edge coloring of the complete graph Kn is said t...
For i = 1,2,...,k, let Gi be a graph with vertex set [n] = {1,...,n} containing no Fi as a subgraph....
AbstractFor i = 1, 2, … , k, let Gi be a graph with vertex set [n] = {1,…,n} containing no Fi as a s...
AbstractLet H be a fixed forbidden graph and let f be a function of n. Denote by RT(n,H,f(n)) the ma...
AbstractWe prove Harary′s conjecture that for any graph G with n edges and without isolated vertices...
AbstractWe prove Harary′s conjecture that for any graph G with n edges and without isolated vertices...
AbstractThe Ramsey number r(H,Kn) is the smallest integer N so that each graph on N vertices that fa...
For a graph H and an integer n, theTurán number ex(n, H) isthemaximum possible number of edges in a ...
AbstractRamsey- and Turán-type problems were always strongly related to each other. Motivated by an ...
A graph with many vertices cannot be homogeneous, i.e., for any pair of integers (i,j) all large gra...
AbstractWe prove that for any fixed integer m⩾3 and constants δ>0 and α⩾0, if F is a graph on m vert...
For each n and k, we examine bounds on the largest number m so that for any k-coloring of the edges ...
We prove that for any fixed integer m ≥ 3 and constants δ > 0 and α ≥ 0, if F is a graph on m vertic...
We show that for any graph G with N vertices and average degree d, if the average degree of any neig...
We study two problems in graph Ramsey theory. In the early 1970s, Erdős and O'Neil considered a...
Fix positive integers p and q with 2 ≤ q ≤ (p2). An edge coloring of the complete graph Kn is said t...
For i = 1,2,...,k, let Gi be a graph with vertex set [n] = {1,...,n} containing no Fi as a subgraph....
AbstractFor i = 1, 2, … , k, let Gi be a graph with vertex set [n] = {1,…,n} containing no Fi as a s...
AbstractLet H be a fixed forbidden graph and let f be a function of n. Denote by RT(n,H,f(n)) the ma...
AbstractWe prove Harary′s conjecture that for any graph G with n edges and without isolated vertices...
AbstractWe prove Harary′s conjecture that for any graph G with n edges and without isolated vertices...
AbstractThe Ramsey number r(H,Kn) is the smallest integer N so that each graph on N vertices that fa...
For a graph H and an integer n, theTurán number ex(n, H) isthemaximum possible number of edges in a ...
AbstractRamsey- and Turán-type problems were always strongly related to each other. Motivated by an ...
A graph with many vertices cannot be homogeneous, i.e., for any pair of integers (i,j) all large gra...
AbstractWe prove that for any fixed integer m⩾3 and constants δ>0 and α⩾0, if F is a graph on m vert...
For each n and k, we examine bounds on the largest number m so that for any k-coloring of the edges ...
We prove that for any fixed integer m ≥ 3 and constants δ > 0 and α ≥ 0, if F is a graph on m vertic...
We show that for any graph G with N vertices and average degree d, if the average degree of any neig...
We study two problems in graph Ramsey theory. In the early 1970s, Erdős and O'Neil considered a...
Fix positive integers p and q with 2 ≤ q ≤ (p2). An edge coloring of the complete graph Kn is said t...
DOI
Add to ORKG