ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G4=(A,B,E)G_4=(A,B,E) be the bipartite incidence graph of the complete graph K4K_4, with A=E(K4)A=E(K_4), B=V(K4)B=V(K_4), and (e,v)∈E(e,v)\in E exactly when v∈ev\in e. Let PG4,AP_{G_4,A} and PG4,BP_{G_4,B} be the associated posets, and let  ⁣La(n,{PG4,A,PG4,B})\mathop{}\!\mathrm{La}(n,\{P_{G_4,A},P_{G_4,B}\}) denote the maximum size of a family in 2[n]2^{[n]} containing neither poset. The non-principal pair of posets conjecture.

 ⁣La(n,PG4,A)− ⁣La(n,{PG4,A,PG4,B})=Ω((nn/2)).\mathop{}\!\mathrm{La}(n,P_{G_4,A})-\mathop{}\!\mathrm{La}(n,\{P_{G_4,A},P_{G_4,B}\})=\Omega\left(\binom{n}{n/2}\right).

This predicts that the family of posets {PG4,A,PG4,B}\{P_{G_4,A},P_{G_4,B}\} is not asymptotically principal: forbidding both posets costs a positive-order middle-layer term beyond forbidding PG4,AP_{G_4,A} alone. The source gives no resolution, so the conjecture remains 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.