27 citations · 137 across the 40 of their papers we have counts for
5 papers · 1 filter
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game
Y. Kohayakawa, F. K. Miyazawa, Y. Wakabayashi
We prove a tight lower bound on the asymptotic performance ratio of the bounded space online -hypercube bin packing problem, solving an open question raised in 2005. In the…
Making spanning graphs
Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +2
We prove that for each there exists such that whenever , in the Maker-Breaker game played on , Maker has a s…
Estimating parameters associated with monotone properties
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang +2
There has been substantial interest in estimating the value of a graph parameter, i.e., of a real-valued function defined on the set of finite graphs, by querying a randomly sample…
The size-Ramsey number of powers of paths
Dennis Clemens, Matthew Jenssen, Yoshiharu Kohayakawa +4
Given graphs and and a positive integer say that is -Ramsey for , denoted , if every -colouring of the edges of contains a monochro…
On hypergraphs without loose cycles
Jie Han, Yoshiharu Kohayakawa
Recently, Mubayi and Wang showed that for and , the number of -vertex -graphs that do not contain any loose cycle of length is at most $2^{O( n^{r…