Enumerative combinatorics \{For enumeration in graph theory, see 05C30\}
2 mapped entries · Browse and filter all →
Counts include all statuses and descendants. Classifications are editorial or inferred from community fields, not an AMS assessment of the problem.
Stanley–Wilf limit for the permutation pattern 1324 : determine C 30 or improve its bounds; the repository records 10.27 (lower) and 13.5 (upper).
Short Superpermutations over 8, 9, and 10. Moderately interesting problem from Epoch AI’s FrontierMath: Open Problems; answers are checked by a verifier program.
These are selected sources for the parent class. Article coverage is a first reviewed selection, and may not cover this exact subcategory.
Electronic Journal of Combinatorics
Combinatorics and graph theory
Journal discovery is available; article-level extraction for this class is not yet included in this batch.
View source evidence →MSC2020 © Mathematical Reviews (AMS) and zbMATH · CC BY-NC-SA 4.0 · Official PDF, page 11