ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A bipartisan graph is a graph such that neither it nor its complement has an odd hole, a long prism, a double-diamond, or L(K3,3∖e)L(K_{3,3}\setminus e). A quasi-parity graph is a graph in which every induced subgraph or its complement has an even pair.

Maffray–Thomas conjecture. Every bipartisan graph is a quasi-parity graph.

The conjecture was proposed as a possible replacement for the final part of the proof of the strong perfect graph theorem for bipartisan graphs. The supplied status evidence says that this claim is false.

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.