29 problems
Let be a graph with , and let . For a graph property and its weaker version \widetilde\mathcal P(F;1/m,\dots,1/m), the source con…
Let be the relevant colored graph, and let an -good sequence have limiting edge density and profile . Define the constructio…
Semi-inducibility conjecture for . The semi-induced density satisfies
Strong modeling limit conjecture. Every FO-convergent sequence of graphs in has a strong modeling FO-limit. The paper proves existence of modeling FO-limits for monadi…
Let be a Lebesgue graph, meaning a graph on the standard probability space whose edge set is Lebesgue-measurable. A finite graph has a density in a graph gi…
Nešetřil–Ossona de Mendez's strong mass-transport conjecture. Every first-order convergent sequence of graphs from has a modeling limit that satisfies the strong finitar…
For , let be coefficients and define … where is the induced density of . Let denote the set of optimal vectors, and write for the c…
For , let be coefficients and define a graph parameter by … where is the induced density of the clique . Let denote the set of optimal ve…
Weighted Aldous–Lyons soficity conjecture. There exists a sequence of -weighted graphs such that is the limit of .
Admissible-lift conjecture. Every local-global convergent sequence of graphs in a nowhere dense class has a modeling limit.
Let and let be a sequence of infinite transitive graphs converging locally to an infinite transitive graph . For an infinite transitive graph…
Constant-community approximation conjecture. There is a constant independent of , but dependent on the weights , such that every is -close…
Finite-graph -minimizing partition conjecture. For every continuous and strictly concave function and every , there exist…
Lovász–Szegedy finite-dimensionality conjecture. The space of typical vertices of every finitely forcible graphon has finite dimension.
Let be a modeling. Assume: (i) the theory of has the finite model property; (ii) every interpretation of satisfies the finitary mass transport p…
Let be a sequence of graphs convergent in the dense model. For a graph of order , let denote its rescaled chromatic measure, defined from the chromatic-roo…
Measurable-function representation conjecture. The limit of every QF-convergent sequence of finite -structures can be represented by a measurable function
Let be a nowhere-dense class of graphs. A sequence of graphs from is first order convergent if the limiting frequency of every first-order property exists. A…
Let be a non-empty graph with vertex set , and let satisfy … Write for t…
Three-variable kernel conjecture. If , then almost everywhere. If , then, almost everywhere,
For a graph on vertices, let be the degree of a uniformly random vertex of . Let and denote the classes of unlabeled and labe…
Let and denote, respectively, the classes of unlabeled and labeled string graphs on vertices, and let be the corresponding graph…
Let be a sequence of branching partitions and let be a branching partition. Write…
Local-global convergence conjecture. A growing sequence of random -regular graphs is local-global convergent with probability one.
Let be a vector of graphs, and let be its limit object, a compact convex set whose volume is measured in its ambient finite-dimensional space.…