In every triangle-free graph, is the ratio of the maximum independent-set size to the average independent-set size at least 4/3; and in every triangle-free graph of minimum…
Statement
In every triangle-free graph, is the ratio of the maximum independent-set size to the average independent-set size at least 4/3; and in every triangle-free graph of minimum degree d, is that ratio at least 2-o_d(1)?
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.