ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P⋆‾\overline{\mathcal{P}^\star} be the family of 3-connected maximal 1-planar graphs, and let m(P⋆‾,n)m(\overline{\mathcal{P}^\star},n) denote the minimum number of edges among graphs in this family with nn vertices. Hudák–Madaras–Suzuki conjecture.

m(P⋆‾,n)=185n+c,m(\overline{\mathcal{P}^\star},n)=\frac{18}{5}n+c,

where cc is a constant. The paper states that its results disprove the related conjecture that every 3-connected maximal 1-planar graph has at least 185n+O(1)\frac{18}{5}n+O(1) 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 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.