ProbXiv
Explorersign in
Problem archiveProblem record

Statement

All graphs here are finite, simple and undirected. For a graph GG write V(G)V(G) for its vertex set, E(G)E(G) for its edge set, n=∣V(G)∣n=|V(G)|, and Δ(G)\Delta(G) for its maximum degree. Call GG overfull if

∣E(G)∣>Δ(G)⌊∣V(G)∣2⌋.|E(G)| > \Delta(G)\left\lfloor \frac{|V(G)|}{2} \right\rfloor .

Let χ′(G)\chi'(G) denote the chromatic index of GG, i.e. the least number of colours in a proper edge colouring of GG; then Δ(G)≤χ′(G)≤Δ(G)+1\Delta(G) \le \chi'(G) \le \Delta(G)+1, and GG is said to be of class 1 if χ′(G)=Δ(G)\chi'(G)=\Delta(G) and of class 2 if χ′(G)=Δ(G)+1\chi'(G)=\Delta(G)+1.

For every graph GG on nn vertices with

Δ(G)>n3,\Delta(G) > \frac{n}{3},

the following two conditions are equivalent:

  1. χ′(G)=Δ(G)+1\chi'(G) = \Delta(G)+1; 2. GG has a subgraph SS with Δ(S)=Δ(G)\Delta(S) = \Delta(G) and ∣E(S)∣>Δ(S)⌊∣V(S)∣/2⌋|E(S)| > \Delta(S)\left\lfloor |V(S)|/2 \right\rfloor.

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.