ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T1T_1 and T2T_2 be trees of order nn. Write T1◃T2T_1\triangleleft T_2 when the independence polynomial order satisfies the strict relation, and T2⊴T1T_2\trianglelefteq T_1 for the corresponding non-strict relation. Oboudi's comparability conjecture. Is it true that

T1◃T2orT2⊴T1?T_1\triangleleft T_2\quad\text{or}\quad T_2\trianglelefteq T_1?

The question asks whether every pair of trees of the same order is comparable in this order; the paper presents an infinite family showing that the proposed comparability fails.

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.