ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a graph with order hh and chromatic number rr. Let χcr(H)\chi_{cr}(H) denote its critical chromatic number and let hcf(H)hcf(H) denote its highest common factor. For a balanced rr-partite graph GG, let δˉ(G)\bar{\delta}(G) be its pairwise minimum degree. Multipartite tiling threshold conjecture. There exist integers CC and m0m_0 such that, for all m≥m0m\ge m_0, if GG is a balanced rr-partite graph with n=mhn=mh vertices in each partition set and

δˉ(G)≥{(1−1/χcr(H))n+Cif hcf(H)=1,(1−1/χ(H))n+Cotherwise,\bar{\delta}(G) \ge \begin{cases} (1-1/\chi_{cr}(H))n+C & \text{if } hcf(H)=1,\\ (1-1/\chi(H))n+C & \text{otherwise}, \end{cases}

then GG contains an HH-factor. This is proposed as an analogue of the bipartite tiling threshold and the supplied text gives no resolution.

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.