Effective Bounds for Induced Size-Ramsey Numbers of Cycles
Domagoj Bradač,
Nemanja Draganić,
Benny Sudakov
Abstract:The induced size-Ramsey number $$\hat{r}_\text {ind}^k(H)$$
r
^
ind
k
(
H
)
of a graph H is the smallest number of edges a (host) graph G can have such that for any k-coloring of its edges, there exists a… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.