ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph of order n≥2n\ge 2, and let L(G)L(G) and M(G)M(G) denote its line graph and middle graph, respectively. The line-middle graph inequality conjecture asserts that

γ~c(L(G))≤γ~c(M(G)).\gamma{\tilde{}} _{c}(L(G)) \le \gamma{\tilde{}} _{c}(M(G)).

The inequality is supported by the preceding results, including strict inequality for wheels of order at least five; equality occurs for at least one connected graph of order four. A classification of graphs for which equality holds is posed separately as an open problem, while the general inequality remains open.

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.