← All problems

Karzanov–Lomonosov conjecture on k-cross-free families

This entry tracks Karzanov–Lomonosov conjecture on k-cross-free families.

It changes the conjectured order of growth and identifies the correct logarithmic scale up to constants.

Latest development

A cyclic-interval construction gives a logarithmic-in-k lower bound, with a matching O(kn log k) upper bound for a shift-invariant subclass.

Editorial caveat

Exact constants and full optimality remain open.

References

Source: arXiv

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.