9 problems

Burr–Erdős–Faudree–Rousseau–Schelp conjecture. The size Ramsey number of the two star forests satisfies

Davoodi–Javadi–Kamranian–Raeisi conjecture. The multicolor size Ramsey number satisfies

Pach–Saghafian–Schnider conjecture. For any $n\ge k\ge 2$,

A complete geometric graph is a complete graph drawn with vertices in general position and straight-line edges. A plane star-forest is a forest whose connected components are stars…

A complete geometric graph is a complete graph drawn with vertices in general position and straight-line edges. A plane $k$-star-forest is a star-forest with at most $k$ connected…

Let $G$ be a graph with $\binom{m+1}{2}$ edges. An ascending subgraph decomposition is a decomposition $H_1,\dots,H_m$ in which $H_i$ has $i$ edges and is a subgraph of $H_{i+1}$ f…

Plane star-forest covering conjecture. There is no complete geometric graph with $n$ vertices that can be decomposed into fewer than

Multicolor star-forest conjecture. The multicolor size Ramsey number satisfies

Let $F$ be a star forest with ${n+1\choose 2}$ edges, and suppose that every connected component of $F$ has size at least $n$. An ascending subgraph decomposition (ASD) is an edge…