Density-dependent antimagic conjecture for large-maximum-degree graphs
Statement
Let be a connected graph with , , and let be a positive integer. Density-dependent antimagic conjecture. If and for some positive function , then is antimagic. This is motivated by the paper's result for and , and by prior results for graphs of sufficiently large average degree; the source presents the statement as a conjecture and gives no resolution.
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.