ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with V≥9V\geq 9 vertices. A (G,k)(G,k)-cockade is obtained recursively by starting with a graph isomorphic to GG and repeatedly identifying complete subgraphs of size kk of two such cockades. For graphs Ka1,…,arK_{a_1,\ldots,a_r}, the notation denotes the complete multipartite graph with parts of sizes a1,…,ara_1,\ldots,a_r.

K10-minor extremal graph conjecture. A graph on V≥9V\geq 9 vertices with no K10K_{10}-minor has at most 8V−368V-36 edges, unless it is isomorphic to one of the following graphs: a (K1,1,2,2,2,2,2,7)(K_{1,1,2,2,2,2,2},7)-cockade; K1,2,2,2,3,3K_{1,2,2,2,3,3}; K2,2,2,2,2,3K_{2,2,2,2,2,3}; K2,2,2,2,2,3K_{2,2,2,2,2,3} with an edge deleted; K2,3,3,3,3K_{2,3,3,3,3}; K2,3,3,3,3K_{2,3,3,3,3} with an edge deleted; K2,2,3,3,4K_{2,2,3,3,4}; or the graph obtained from the disjoint union of K2,2,2,2K_{2,2,2,2} and C5C_5 by adding all edges joining them.

This conjecture generalizes the known extremal results for graphs with no K8K_8- or K9K_9-minor, identifying the possible exceptional graphs in the K10K_{10}-minor case. Its resolution is not supplied in the source.

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.