replying to yes no questions

2025 March 15

you ever get a question that's yes or no texted to you? and you reply with an absurdly difficult question which reduces to the answer you would have given if you were telling the truth?

like this:

A: you get into [beaver emoji]?
B: Is it true that each $3$-connected planar cubic graph has a Hamiltonian cycle?

bonus points if you rephrase it in a way that is hard to google.
so preferably this example would go:

A: you get into [beaver emoji]?
B: Define $\text{cat}(X)$ to be the smallest integer k such that, for each open covering $\{U_i\}_{1\le i\le k}$ of $X$, the inclusion map $U_i\hookrightarrow X$ is nullhomotopic, and define $S_n$ to be the $n$-dimensional sphere. Is it true that for all $n>0$, $\text{cat}(X\times S^n)=\text{cat}(X)+1?$

Answers for the curious (thanks, Wikipedia): Tait's conjecture (graph theory), Ganea conjecture (algebraic topology)