ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let α∈[0,1/2)\alpha\in[0,1/2) and n,t≥1n,t\geq 1. Let F(t)(n,α)F^{(t)}(n,\alpha) be the smallest mm such that we can 22-colour the edges of the complete tt-uniform hypergraph on nn vertices such that if X⊆[n]X\subseteq [n] with ∣X∣≥m\lvert X\rvert \geq m then there are at least α(∣X∣t)\alpha \binom{\lvert X\rvert}{t} many tt-subsets of XX of each colour. For fixed n,tn,t as we change α\alpha from 00 to 1/21/2 does F(t)(n,α)F^{(t)}(n,\alpha) increase continuously or are there jumps? Only one jump?

Record

Added
Links

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.