ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT and T′T' be trees of respective orders nn and n′n'. For each graph GG, let f(G)f(G) denote the maximum number of vertices that induce a forest in GG, and let SnS_n denote the star on nn vertices.

Wang–Wu's conjecture.

f(T □ ⁡T′)≤f(Sn □ ⁡Sn′).f(T \operatorname{\,\square\,} T') \leq f(S_n \operatorname{\,\square\,} S_{n'}).

This conjecture was resolved by the paper: the authors prove the equivalent decycling-number inequality in the opposite direction, using ∇(G)+f(G)=∣V(G)∣\nabla(G)+f(G)=|V(G)| for Cartesian products with the same order. The extremal role of the product of stars is therefore established.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.