Ramsey-style hypergraph construction
Statement
Let be the largest integer such that there exists a hypergraph with , no isolated vertices, and no partition of size greater than , where a hypergraph contains a partition of size if there are and with such that every member of is contained in exactly one member of . Define and, for , define . It is known that . Construct, for general input , a hypergraph witnessing for some constant , with the improvement already effective at . The construction must be given as an algorithm that outputs the witness as a string whose vertices are labeled and whose edges are written using curly braces; for , it must terminate within minutes on a typical laptop.
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.