A variant of the Erdős–Faber–Lovász conjecture (Tom Kelly) The Erdős–Faber–Lovász conjecture is the following: If G1 , .
Statement
A variant of the Erdős–Faber–Lovász conjecture (Tom Kelly) The Erdős–Faber–Lovász conjecture is the following: If G1 , . . . , Gn are complete graphs, S each on at most n vertices, such that every pair shares at most one vertex, n then χ( i=1 Gi ) ⩽ n. There are still several variations and possible generalizations that remain open. What is the largest possible chromatic number of χ( i=1 Gi )? 15. Structure and coloring of 3-connected graphs with no large odd holes (Xingxing Yu) Definition: Let G denote the class of all graphs G with the following properties: • G is 3-connected and internally 4-connected, • the girth of G is 5, and • G contains no odd holes of length at least 7.
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.