The K10-minor extremal graph conjecture
Statement
Let be a graph with vertices. A -cockade is obtained recursively by starting with a graph isomorphic to and repeatedly identifying complete subgraphs of size of two such cockades. For graphs , the notation denotes the complete multipartite graph with parts of sizes .
K10-minor extremal graph conjecture. A graph on vertices with no -minor has at most edges, unless it is isomorphic to one of the following graphs: a -cockade; ; ; with an edge deleted; ; with an edge deleted; ; or the graph obtained from the disjoint union of and by adding all edges joining them.
This conjecture generalizes the known extremal results for graphs with no - or -minor, identifying the possible exceptional graphs in the -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.