Combinatorics
Provisional editorial order for Top Open Problems: Millennium Prize Problems first, followed by assessed difficulty tiers; the unassessed remainder keeps its previous catalogue order. About rankings
Browse by subject
Search this collection by problem ID, title, classification, subject, provider, or model.
Search results
No matching problems. Try another search or clear a filter.
417 records · Search and filter
- Math-3802 Upper bound on the divisorial gonality of a graph
- Math-3803 Is it true that every graph whose vertices have odd degree greater than one contains a cycle of length 2^(n) for some n
- Math-3804 Suppose G has n vertices and no induced copy of H
- Math-3805 Show that every (1/2+ľ)|E(ő_(n))| edges of the n-cube ő_(n) contains a C_(4) when n is sufficiently large
- Math-3806 What are the (homogeneous adjacency) spectra of the ultracube and the complete hypergraph
- Math-3807 Is it true that the sum of the k largest Laplacian eigenvalues of a graph with m edges is at most k(k+1)/2+m
- Math-3808 Is it possible for a permutation on n symbols to contain exactly n
- Math-3809 A d-dimensional permutation of order n is an n-by-n-by
- Math-3817 For each k and every sufficiently large n with k dividing ((n-1) choose (k-1)), there is a universal cycle for the k-sub
- Math-3818 Let G be a bicolored graph, and let H be the graph whose vertices are the valid pressing sequences of G and whose edges
- Math-3819 Dittert–Hajek conjecture
- Math-3820 Minimum length of a superpermutation
- Math-3821 Rudin's conjecture on squares in progressions
- Math-3822 Exact Dedekind numbers
- Math-4000 Extending Pseudosegment Arrangements by Subdivision
- Math-4004 Rolling a Die over a Labeled Board
- Math-4008 Slicing Axes-Parallel Rectangles