Mathematics catalogue
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.
16,859 records · Search and filter
- Math-8501 List chromatic number and maximum degree of bipartite graphs
- Math-8502 Colouring the square of a planar graph
- Math-8503 Bounding the on-line choice number in terms of the choice number
- Math-8504 Choosability of Graph Powers
- Math-8505 2-colouring a graph without a monochromatic maximum clique
- Math-8506 List Colourings of Complete Multipartite Graphs with 2 Big Parts
- Math-8507 Cycles in Graphs of Large Chromatic Number
- Math-8508 The Two Color Conjecture
- Math-8509 The Bermond-Thomassen Conjecture
- Math-8510 Seymour's Second Neighbourhood Conjecture
- Math-8511 Non-edges vs. feedback edge sets in digraphs
- Math-8512 Oriented trees in n-chromatic digraphs
- Math-8513 Directed path of length twice the minimum outdegree
- Math-8514 Caccetta-Häggkvist Conjecture
- Math-8515 Long directed cycles in diregular digraphs
- Math-8516 Arc-disjoint out-branching and in-branching
- Math-8517 Hoàng-Reed Conjecture
- Math-8518 Arc-disjoint directed cycles in regular directed graphs
- Math-8519 Large acyclic induced subdigraph in a planar oriented graph.
- Math-8520 Monochromatic reachability or rainbow triangles
- Math-8521 Decomposing an even tournament in directed paths.
- Math-8522 Decomposing k-arc-strong tournament into k spanning strong digraphs
- Math-8523 Triangle-packing vs triangle edge-transversal.
- Math-8524 The Bollobás-Eldridge-Catlin Conjecture on graph packing
- Math-8525 Weak saturation of the cube in the clique
- Math-8526 Simultaneous partition of hypergraphs
- Math-8527 Turán's problem for hypergraphs
- Math-8528 Coloring random subgraphs
- Math-8529 Negative association in uniform forests
- Math-8530 Chromatic number of random lifts of complete graphs
- Math-8531 Domination in plane triangulations
- Math-8532 Large induced forest in a planar graph.
- Math-8533 Every 4-connected toroidal graph has a Hamilton cycle
- Math-8534 Degenerate colorings of planar graphs
- Math-8535 3-Colourability of Arrangements of Great Circles
- Math-8536 The Crossing Number of the Complete Graph
- Math-8537 The Crossing Number of the Complete Bipartite Graph
- Math-8538 Crossing numbers and coloring
- Math-8539 Are different notions of the crossing number the same?
- Math-8540 Universal point sets for planar graphs
- Math-8541 Which lattices occur as intervals in subgroup lattices of finite groups?
- Math-8542 MSO alternation hierarchy over pictures
- Math-8543 Vertex Cover Integrality Gap
- Math-8544 Chowla's cosine problem
- Math-8545 Quartic rationally derived polynomials
- Math-8546 3 is a primitive root modulo primes of the form 16 q^4 + 1, where q>3 is prime
- Math-8547 Sum of prime and semiprime conjecture
- Math-8548 Giuga's Conjecture on Primality
- Math-8549 Goldbach conjecture
- Math-8550 Euler-Mascheroni constant