Graffiti Conjecture 143
Statement
Graffiti Conjecture 143. If is connected and not a tree, then
Here is the maximum order of an induced tree in , is the girth of , and is the next-to-last entry in the nondecreasing degree sequence of .
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.