26 problems
A smoothly embedded projective plane in is knotted if it is not the standard unknotted embedding, and it is reducible if it admits an unknotted summand that is not a -sphe…
Toroidal shallow-minor conjecture. There is no constant with the following property: every toroidal graph is a congestion- depth- minor of a planar graph.
Surface transduction-order conjecture. Let and be surfaces such that . Then
Let be a surface and let denote its genus. Fix an integer for which there is a value such that every -locally planar gra…
Let be a graph embedded in a surface , and let denote the genus of . A graph is -locally planar if the relevant local planarity condition hold…
Jackson and Ringel's conjecture. For all , the bound in this inequality is tight:
Genus-square-root conjecture. If is a graph of genus , then
Let be a genus function and let be one of the labelled graph classes considered in the paper. Logarithmic-threshold growth-constant conjecture. If is a con…
Let be a genus function, and let denote one of the graph classes considered in the paper, such as , ,…
Let be one of the graph classes considered in the paper, indexed by graphs on embeddable in surfaces of Euler genus at most . Genus-increment growth-ratio c…
Let be the maximum choice–chromatic gap among graphs embeddable on the orientable surface of genus with chromatic number , and let be the maximum chromat…
Let denote the maximum of the difference between list-chromatic number and chromatic number over graphs embeddable on the orientable surface of genus with chromati…
Triangle-maximisation conjecture. If
Simultaneous clique-maximisation conjecture. If , then for every ,
Let denote Dyck's surface, and let an Euler impure graph be an edge-maximal graph embeddable on a surface that does not triangulate that surface. For a graph and…
Weinstein-trisection characterization conjecture. The surface is isotopic to a symplectic surface if and only if it is isotopic into transverse bridge position with r…
Let be a map on a genus orientable surface. An edge, positive-vertex, positive-face angle labeling means a labeling with the edge condition and positive vertex and fa…
Maximal surface-graph conjecture. The sequence Benjamini--Schramm converges, and its limit coincides with the UIPT.
Angle-labeling characterization of essentially 3-connected maps. The map admits an edge, -vertex, -face angle labeling if and only if it is essentia…
Let be a cycle of even length , let be a path of odd order , and let denote their bow-tie graph. 3-extendability conjecture. For any even…
Let be a connected graph of orientable genus and non-orientable genus . Let be its bondage number and its maximum vertex degree. Let and …
Embedding conjecture. Every graph embeds in .
Large-edgewidth boxicity conjecture. There exists an integer such that every graph embeddable on with edgewidth at least has boxicity at most thr…
Let be a fixed surface. For a graph embeddable on with a -system, define … and let . The surface -system list-colo…
DeVos–Mohar–Samal conjecture. For every optimal drawing of on , the restrictions to and do not intersect.