ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a loopless graph of order nn, and let kk be a positive integer. A subgraph HH of GG is modulo kk-regular if every vertex has degree divisible by kk in HH.

Alon–Friedland–Kalai conjecture. If

∣E(G)∣>(k−1)n,|E(G)|>(k-1)n,

then GG admits a modulo kk-regular subgraph.

Alon, Friedland, and Kalai proved the conjecture when kk is a prime power. A weaker version was later established with a larger edge bound, while the source paper improves that bound; the full conjecture remains open for general positive integers kk.

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.