ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with nn vertices and no isolated vertices. Let alpha(G)alpha(G) be its stability number, sigmae(G)=omegae(G‾)sigma_e(G)=omega_e(\overline G) its edge-stable-set invariant, omega(G)omega(G) its clique number, and omegae(G)omega_e(G) its edge-clique-covering number. Ore's conjecture. If

alpha(G)=sigmae(G)andomega(G)=omegae(G),alpha(G)=sigma_e(G)\qquad\text{and}\qquad omega(G)=omega_e(G),

then

omegae(G)sigmae(G)≤n.omega_e(G)sigma_e(G)\leq n.

The source presents this as an answer to an open question posed by Ore and as a variant for connected graphs of Turán's theorem; the supplied status is open.

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.