7 problems

Let $G$ be a $k$-connected graph with $k\geq 2$, and let $F$ be a linear forest, meaning a graph whose components are paths, that is a subgraph of $G$ with $l$ edges and $t$ isolat…

Let $n$, $k$, and $s$ be integers, and let $P_3$ denote the path on three vertices. Write $kP_3$ for the disjoint union of $k$ copies of $P_3$, and let $M_n$ be the graph consistin…

All graphs are finite, simple, and undirected; for a graph $G$, let $V(G)$ be its vertex set and let $d(v)$ denote the degree of $v$. A linear forest is a forest in which every com…

Let $r\geq 2$, and let $\mathcal{L}_{n,k}^{(r)}$ be the family of all tight linear forests of order $n$ with $k$ edges in $r$-graphs. Here a tight linear forest is an $r$-graph who…

Let $P_3$ be the path on three vertices, and let $gr_k(K_3:n_1P_3,\ldots,n_kP_3)$ denote the corresponding Gallai-Ramsey number. For positive integers $k,n_1,n_2,\ldots,n_k$ with…

Let $P_3$ denote the path on three vertices, and let $gr_k(K_3:n_1P_3, \ldots,n_kP_3)$ be the corresponding multicolor Gallai-Ramsey number. For positive integers…

Let $P_n$ be the path on $n$ vertices, let $F$ be a non-empty linear forest on $m$ vertices, let $K_1\vee F$ denote the join of $F$ with a single vertex, and let $o(F)$ be the numb…