Hudák–Madaras–Suzuki conjecture on 3-connected maximal 1-planar graph size
Statement
Let be the family of 3-connected maximal 1-planar graphs, and let denote the minimum number of edges among graphs in this family with vertices. Hudák–Madaras–Suzuki conjecture.
where is a constant. The paper states that its results disprove the related conjecture that every 3-connected maximal 1-planar graph has at least edges.
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.