A triangle-free graph is k-existentially-complete if for every independent set A and disjoint set B with |A|+|B|\le k there is a vertex adjacent to every vertex of A and to…
Statement
A triangle-free graph is k-existentially-complete if for every independent set A and disjoint set B with |A|+|B|\le k there is a vertex adjacent to every vertex of A and to none of B. Is there a constant r such that no triangle-free graph is r-existentially-complete?
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.