29 problems
General convergence conjecture. The process converges weakly to in , uniformly with respect to the initial condition…
Let be a graph, and let be the associated -graph. For an integer , let and be the minimal degrees of a on and…
Inradius upper-bound conjecture. There is no universal constant such that
Mean-distance upper-bound conjecture. There is no universal constant such that
Let be a connected metric graph endowed with an interval exchange transformation partitioning into intervals with lengths l…
Let be a metric graph of genus , and let be integers satisfying . The Brill–Noether rank is the tropical Brill–Noether rank. Jensen–…
For each rank , let be the constant from the theorem asserting that every rank- metric graph contains a proper subgraph whose entropy is at least . Conjectur…
Let and let be a mass. An energy ground state is a positive solution of the NLS variational problem on the -metric graph that minimizes the energy…
Let be a compact metric graph with edge set . A Gaussian Markov random field of order is assumed to satisfy some mild regularity conditions. On each edge…
Let , , be a domain, possibly equal to , and let be a sufficiently smooth potential bounded from belo…
Fix a positive integer . For a metric graph with rational edge lengths, the Metric Divisorial Gonality problem asks whether…
Full support eigenfunctions conjecture. For any metric graph , and any choice of a complete orthonormal sequence of eigenfunctions, there are infinitely…
-independent spectrum conjecture. For every graph , possibly except for some pathological cases, there is a generic set such that,…
Let be a planar metric graph, meaning a geodesic space homeomorphic to a finite -dimensional simplicial complex that admits a planar embedding. Let be a coefficient grou…
Let be a connected loopless multigraph, let be the corresponding metric graph with unit edge lengths, and let . For each integer , let…
Let be any sequence of standard graphs, labeled by their first Betti numbers. For each , choose arbitrary…
Let . A metric graph of rank has unit entropy when its entropy is normalized to equal , and a subgraph is proper when it is a strict subgraph of the graph. Uniform…
Loose-versus-non-exhaustive partition conjecture. The infimum over non-exhaustive rigid -partitions satisfies
Let be a metric graph and let . A rigid -partition is a partition of of the type considered in the paper, and is called interna…
Let be a finite, compact, connected metric graph. An exhaustive rigid -partition of is a partition w…
Let be a metric graph whose skeleton is the complete graph , and let be its canonical divisor. Write for the associated linear system, and call the cells…
Let be a metric graph of genus . For integers and satisfying … let denote the Brill–Noether rank, namely the largest integer such that ev…
Let be a two-dimensional lattice polygon, and let denote the convex hull of the interior lattice points of . Write…
Let be a metric graph of genus . A minimal rank-determining set is a rank-determining set of that has no proper subset that is rank-determining. Cardinality bo…
Geodetic approximation conjecture. For every , there is a Cauchy sequence such that every is the homology class of a fi…