bookmarks

Coloring - Hoffman-Singleton packing - Seymour's 2nd Neighborhood Conjecture - Sumner's Universal Tournament Conjecture - Caccetta-H?ggkvist Conjecture - Zhang's Hamiltonian weight conjecture - Bermond's Conjecture - Induced forests in planar graphs - cyclic edge-connectivity of planar graphs - Tutte's 3-flow Conjecture (& 4 5) - etc.

P versus NP, The Hodge Conjecture, The Riemann Hypothesis, Yang-Mills Existence and Mass Gap, Navier-Stokes Existence and Smoothness, The Birch and Swinnerton-Dyer Conjecture

Stefan Banach was the first to enter a problem to the Book on July 17 of 1935. The last problem, problem 193, was due to Hugo Steinhaus and it bears the date of May 31, 1941. The total number of problems was actually greater than 193, since the numeration used to be repetitive. For instance, there was problem number 10.1, 15.1 or 17.1. Most problems have been solved, though not all of them. In some cases the solution was not a mere intellectual exercise or sport, for it marked the beginning of a new direction of research.

This is a collection of open problems in Discrete Mathematics which are currently being researched by members of the DIMACS community. These problems are easily stated, require little mathematical background, and may readily be understood and worked on by anyone who is eager to think about interesting and unsolved mathematical problems.

This theoretical computer sience problem was published 1946 by Emil Post in Bulletins of the American Math. Society -- Vol. 53. He proved the undeciablility for the general case and hence for the first time introduced a concrete combinatorial puzzle, which was not recursive solvable in the Turing computational model.

ASSOCIATIONS

POINTS DE VUE

PROBLÈMES - PROBLEMS

...This was first published by the Belgian mathematician Eugène Catalan in the year 1888. Leonard Eugene Dickson extended the so called Catalan conjecture: "Each aliquot sequence ends in a prime, in a perfect number or in an aliquot cycle"...

EXEMPLES - EXAMPLES

JAVASCRIPT

Recherches de sous-chaînes du mot infini de Kolakoski K = 121121221221121122121121221121121221221121 qui est autodescriptif. Quelques problèmes ouverts (formule close, sous-chaînes ...)

DOCUMENTS - PAPERS

REPORT

JOURNAUX - LETTERS

DOCUMENTATION

QUESTIONS - FAQ

LIENS - LINKS

Actualités

Advertising : If you see a reference in one of the files that is not linked, and you know of a link address to the appropriate document, please send me mail, and I will include the link in the document. Thanks very much in advance.
Avertissement : Le classement par catégories est approximatif. Certains liens se retrouvent dans des rubriques différentes et sur plusieurs pages. Les commentaires sont généralement des courts extraits des pages référencées. Il est possible que certains liens nécessitent une mise à jour.
Tous commentaires ou remarques sont les bienvenus, vous pouvez les adresser à :

Les mises à jour demandées sont réalisées dès que possible et, sauf si c'est nécessaire, aucun message de réponse n'est expédié. Merci de m'écrire.

Copyright © 1999-2006 Jean-Paul Davalan - Reproduction interdite.

Problèmes & Conjectures

PAGES WEB