ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected simple graph of order nn, and let fo(G)f_o(G) denote the maximum order of an induced subgraph in which every vertex has odd degree.

Berman–Wang–Wargo conjecture. For any connected simple graph GG of order nn,

fo(G)≥2⌊n4⌋.f_o(G)\geq 2\left\lfloor\frac{n}{4}\right\rfloor.

The conjecture is a proposed universal lower bound for connected graphs, but the source explicitly disproves it.

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.