Combinatorica est une revue scientifique de mathématiques fondée en 1981 avec László Babai et László Lovász en tant qu'éditeurs en chef, ainsi que Paul Erdős, de façon honorifique.
Wikimedia Foundation. 2010.
Contenu soumis à la licence CC-BY-SA. Source : Article Combinatorica de Wikipédia en français (auteurs)
Combinatorica — is an international journal of mathematics, publishing papers in the fields of combinatorics and computer science. It started in 1981, with László Babai and László Lovász as the editors in chief with Paul Erdős as honorary editor in chief. The… … Wikipedia
COMBINAT — Combinatorica (informationswissenschaftl. Veoeffentlichungen) … Acronyms
COMBINAT — Combinatorica (informationswissenschaftl. Veröffentlichungen) … Acronyms von A bis Z
Fulkerson-Preis — Der Fulkerson Preis ist ein von der Mathematical Programming Society (MPS) und der American Mathematical Society (AMS) alle drei Jahre vergebener Preis für außergewöhnliche Arbeiten in diskreter Mathematik, worunter zum Beispiel Kombinatorik und… … Deutsch Wikipedia
Hadwiger conjecture (graph theory) — In graph theory, the Hadwiger conjecture (or Hadwiger s conjecture) states that, if an undirected graph G requires k or more colors in any vertex coloring, then one can find k disjoint connected subgraphs of G such that each subgraph is connected … Wikipedia
Tibor Gallai — (eigentlich Tibor Grünwald, * 15. Juli 1912 in Budapest; † 2. Januar 1992 ebenda) war ein ungarischer Mathematiker, der sich insbesondere mit Graphentheorie beschäftigte. Gallai fiel schon als Gymnasiast durch die Lösung mathematischer Probleme… … Deutsch Wikipedia
Erdős–Faber–Lovász conjecture — In graph theory, the Erdős–Faber–Lovász conjecture (1972) is a very deep problem about the coloring of graphs, named after Paul Erdős, Vance Faber, and László Lovász. It says::The union of k copies of k cliques intersecting in at most one vertex… … Wikipedia
Snake-in-the-box — The snake in the box problem in graph theory and computer science deals with finding a certain kind of path along the edges of a hypercube. This path starts at one corner and travels along the edges to as many corners as it can reach. After it… … Wikipedia
Víctor Neumann-Lara — also Víctor Neumann (1933 2004) was a Mexican mathematician, pioneer in the field of graph theory in Mexico. His work also covers general topology, game theory and combinatorics. He has an Erdős number of 2.BiographyBorn in the city of Huejutla,… … Wikipedia
Hedetniemi's conjecture — In graph theory, Hedetniemi s conjecture concerns the connection between graph coloring and the tensor product of graphs. This conjecture states that:χ( G × H ) = min {χ( G ), χ( H )}.Here χ( G ) denotes the chromatic number of an undirected… … Wikipedia
