9 problems

Let $s\in\mathbb{N}$ be square-free, and let $P(s)$ be the set of $\Delta$-primitives with square-free part $s$. A natural number $n$ has a $\Delta$-primitive decomposition if it c…

Linear-time certifying algorithm conjecture. For every fixed positive integer $k$, there is a certifying algorithm that runs in time

Let $p$ and $q$ be distinct primes, and let $x,y\in\mathbb{N}$. Consider natural numbers of the form … A natural number is $\Delta$-primitive if it has the $\Delta$ property and is…

A natural number is called $\Delta$-primitive when it has the $\Delta$ property but is not a nontrivial square multiple of another number with the $\Delta$ property. Infinitude con…

Dai–Zhang–Broerama–Zhang conjecture. Every $(r-1)$-connected $K_{1,r}$-free split graph is Hamiltonian.

Generalized Hamilton-connectedness conjecture. Every $r$-connected ${K_{1,r+1},K_{1,r+1}+e}$-free split graph of order at least $2r+7$ is Hamilton-connected.

Order-bound conjecture. Then

Hilton's conjecture. If $\Delta(G)>\frac{|V|}{3}$, then $G$ is Class 1 if and only if it is not subgraph-overfull. The supplied paper states that this conjecture holds for the clas…

Let $G$ be a free-twin split graph, meaning that $G$ is a split graph with no pair of free twins. Write $\chi_{rlid}(G)$ for its relaxed locally identifying chromatic number and…