Sparse partition universal graphs for graphs of bounded degree

58 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Erdős–Szekeres‐type theorems for monotone paths and convex bodies (2011, background): “[24] recently showed that graphs on n vertices with fixed maximum degree ∆ have size Ramsey number at most O(n2−1/∆ log n).”