Linear growth conjecture for maximal facet dimensions in Eulerian magnitude homology

From papers

Let GG be a graph, let diam(G)\operatorname{diam}(G) denote its diameter, and let \ell be the path-length parameter. Write ftf_t for the facet whose dimension is under consideration. Here dimft\dim f_t\sim\ell means that the dimension of ftf_t is asymptotic to \ell.

Linear growth conjecture. There exists a linear function φ\varphi such that, whenever

φ(diam(G)),\ell\leq\varphi(\operatorname{diam}(G)),

one has

dimft.\dim f_t\sim\ell.

The conjecture proposes that the relevant facet dimension grows linearly with the length parameter when that parameter is bounded linearly in the graph diameter. It is motivated by computations for path graphs and is stated in the context of estimating torsion in Eulerian magnitude homology of random graphs; no resolution is supplied here.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Giuliamaria Menara, “On torsion in eulerian magnitude homology of Erdos-Renyi random graphs”, arXiv:2409.03472 (2024).

Additional references

4 papers in this index state this conjecture (2005–2024). The statement above is taken from the most recent of them; the others are arXiv:2206.01844, arXiv:1604.00424, arXiv:math/0512304.

Solutions 0

No solutions have been posted yet.