Bounded modified saturation for an isolated minimal edge

Let GG) be an edge-ordered graph and let e0e_0 be an isolated minimal edge of GG. Write F=e0+GF=e_0+G. The isolated-edge saturation conjecture.

satm(n,F)=O(1).sat_m(n,F)=O(1).

The authors present this as a candidate explaining why no edge-ordered graph with linear satmsat_m saturation and isolated minimal edge is known. The analogous statement for satesat_e is false.

Sources & referencesView supporting material

Primary source

Vladimir Bošković and Balázs Keszegh, “Saturation of edge-ordered graphs”, arXiv:2408.00457 (2024).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.