Let TsH be the graph obtained from a given graph H by subdividing each edge s times. Motivated by a problem raised by Igor Pak [Mixing time and long paths in graphs, in Proc. of the 13th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002) 321–328], we prove that, for any graph H, there exist graphs G with O(s) edges that are Ramsey with respect to TsH
We say that a graph with n vertices is c-Ramsey if it does not contain either a clique or an indepen...
summary:We consider, for a positive integer $k$, induced subgraphs in which each component has order...
<p>Let $K_{l\times t}$ be a complete, balanced, multipartite graph consisting of $l$ partite sets an...
Let TsH be the graph obtained from a given graph H by subdividing each edge s times. Motivated by a...
We prove that regular graphs with large degree and small mixing time contain long paths and some oth...
We say that a graph with n vertices is c-Ramsey if it does not contain either a clique or an indepen...
Abstract. We say that a graph with n vertices is c-Ramsey if it does not contain either a clique or ...
AbstractLet H be a finite graph. The Ramsey size number of H, r̂(H,H), is the minimum number of edge...
Abstract. The size-Ramsey number r̂(F) of a graph F is the smallest integer m such that there exists...
79 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008.This thesis considers three fa...
79 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008.This thesis considers three fa...
We present a modification of the Depth first search algorithm, suited for finding long induced paths...
The size-Ramsey number of a graph G is the minimum number of edges in a graph H such that every 2-ed...
An n-vertex graph G is c-Ramsey if it contains neither a complete nor an empty induced subgraph of s...
AbstractP. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp [P. Erdös, R.J. Faudree, C.C. Rousseau...
We say that a graph with n vertices is c-Ramsey if it does not contain either a clique or an indepen...
summary:We consider, for a positive integer $k$, induced subgraphs in which each component has order...
<p>Let $K_{l\times t}$ be a complete, balanced, multipartite graph consisting of $l$ partite sets an...
Let TsH be the graph obtained from a given graph H by subdividing each edge s times. Motivated by a...
We prove that regular graphs with large degree and small mixing time contain long paths and some oth...
We say that a graph with n vertices is c-Ramsey if it does not contain either a clique or an indepen...
Abstract. We say that a graph with n vertices is c-Ramsey if it does not contain either a clique or ...
AbstractLet H be a finite graph. The Ramsey size number of H, r̂(H,H), is the minimum number of edge...
Abstract. The size-Ramsey number r̂(F) of a graph F is the smallest integer m such that there exists...
79 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008.This thesis considers three fa...
79 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008.This thesis considers three fa...
We present a modification of the Depth first search algorithm, suited for finding long induced paths...
The size-Ramsey number of a graph G is the minimum number of edges in a graph H such that every 2-ed...
An n-vertex graph G is c-Ramsey if it contains neither a complete nor an empty induced subgraph of s...
AbstractP. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp [P. Erdös, R.J. Faudree, C.C. Rousseau...
We say that a graph with n vertices is c-Ramsey if it does not contain either a clique or an indepen...
summary:We consider, for a positive integer $k$, induced subgraphs in which each component has order...
<p>Let $K_{l\times t}$ be a complete, balanced, multipartite graph consisting of $l$ partite sets an...
DOI
Add to ORKG