The non-principal pair of posets conjecture for the incidence graph of K_4
Statement
Let be the bipartite incidence graph of the complete graph , with , , and exactly when . Let and be the associated posets, and let denote the maximum size of a family in containing neither poset. The non-principal pair of posets conjecture.
This predicts that the family of posets is not asymptotically principal: forbidding both posets costs a positive-order middle-layer term beyond forbidding 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.