ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn and kk be natural numbers with n≥2k+1n\geq 2k+1. The vertex set of the Kneser graph K(n,k)K(n,k) is ([n]k)\binom{[n]}{k}, with two vertices adjacent exactly when they are disjoint. For a connected graph GG, define its toughness by

t(G)=min⁡S∣S∣c(G∖S),t(G)=\min_S\frac{|S|}{c(G\setminus S)},

where the minimum is over vertex cuts SS and c(G∖S)c(G\setminus S) is the number of remaining components. A maximum independent set is an independent set of largest possible size.

The toughness conjecture for Kneser graphs. If k≥5k\geq 5 and n≥2k+1n\geq 2k+1, then

t(K(n,k))=nk−1.t(K(n,k))=\frac{n}{k}-1.

Moreover, if a vertex subset SS satisfies

t(K(n,k))=∣S∣c(K(n,k)∖S),t(K(n,k))=\frac{|S|}{c(K(n,k)\setminus S)},

then SS is the complement of a maximum independent set in K(n,k)K(n,k).

The result is known for k∈{3,4}k\in\{3,4\} for all n≥2k+1n\geq 2k+1, and for k≥5k\geq 5 when nn is sufficiently large as a function of kk. The conjecture asks for the remaining range k≥5k\geq 5 and n≥2k+1n\geq 2k+1.

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.