ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let H(n)H(n) be the largest integer kk such that there exists a hypergraph (V,H)(V,\mathcal H) with ∣V∣=k|V|=k, no isolated vertices, and no partition of size greater than nn, where a hypergraph contains a partition of size mm if there are D⊆VD \subseteq V and P⊆H\mathcal P \subseteq \mathcal H with ∣D∣=m|D|=m such that every member of DD is contained in exactly one member of P\mathcal P. Define k1=1k_1=1 and, for n≥2n\ge 2, define kn=⌊n/2⌋+k⌊n/2⌋+k⌊(n+1)/2⌋k_n=\lfloor n/2\rfloor+k_{\lfloor n/2\rfloor}+k_{\lfloor (n+1)/2\rfloor}. It is known that H(n)≥knH(n)\ge k_n. Construct, for general input nn, a hypergraph witnessing H(n)≥cknH(n)\ge c k_n for some constant c>1c>1, with the improvement already effective at n=15n=15. The construction must be given as an algorithm that outputs the witness as a string whose vertices are labeled 1,…,∣V∣1,\ldots,|V| and whose edges are written using curly braces; for n≤100n\le 100, it must terminate within 1010 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 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.