Determine the largest t=t(k) such that K_k is 2-equivalent to K_k+K_{1,t}, and the largest t=t(k) for which some tree T on t vertices satisfies K_k\sim_2 K_k+T; moreover, for…
Statement
Determine the largest t=t(k) such that K_k is 2-equivalent to K_k+K_{1,t}, and the largest t=t(k) for which some tree T on t vertices satisfies K_k\sim_2 K_k+T; moreover, for each q\ge2, do there exist two non-isomorphic connected q-equivalent graphs?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.