Bosscher, J. R. Bruijn en F. C.

* J. de Hond, " Cornelis de Bruijn ( 1652-1726 / 27 ).

Although De Bruijn graphs are named after Nicolaas Govert de Bruijn, they were discovered independently by both De Bruijn and I. J.

To prove this, one can combine a proof of the theorem for finite planar graphs with the De Bruijn – Erdős theorem stating that, if every finite subgraph of an infinite graph is k-colorable, then the whole graph is also k-colorable.

Enumerative graph theory then rose from the results of Cayley and the fundamental results published by Pólya between 1935 and 1937 and the generalization of these by De Bruijn in 1959.

* 1918 – Nicolaas Govert de Bruijn, Dutch mathematician ( d. 2012 )

De Bruijn showed that Penrose tilings can be viewed as two-dimensional slices of five-dimensional hypercubic structures.

The De Bruijn – Newman constant, denoted by Λ and named after Nicolaas Govert de Bruijn and Charles M. Newman, is a mathematical constant defined via the zeros of a certain function H ( λ, z ), where λ is a real parameter and z is a complex variable.

De Bruijn showed in 1950 that H has only real zeros if λ ≥ 1 / 2, and moreover, that if H has only real zeros for some λ, H also has only real zeros if λ is replaced by any larger value.

The guidance of the group was taken over by Erik Bruijn who is still in charge of a flourishing community.

They also include statements less obviously related to compactness, such as the De Bruijn – Erdős theorem stating that every minimal k-chromatic graph is finite, and the Curtis – Hedlund – Lyndon theorem providing a topological characterization of cellular automata.

The Dutch traveller Cornelis de Bruijn visited Persepolis in 1704.

These include those of George Sandys, André Thévet, Athanasius Kircher, Balthasar de Monconys, Jean de Thévenot, John Greaves, Johann Michael Vansleb, Benoît de Maillet, Cornelis de Bruijn, Paul Lucas, Richard Pococke, Frederic Louis Norden and others.

image: Cornelis de Bruijn, 1698. png | Cornelis de Bruijn, Reizen van Cornelis de Bruyn door de vermaardste Deelen van Klein Asia ( 1698 )

*, the contribution of de Bruijn by himself.

*, reproduces the seminal papers of Curry-Feys and Howard, a paper by de Bruijn and a few other papers.

Pi de Bruijn was the architect for the contemporary annex to the original hall.

For example, there is a unique set that contains the elements a and b and no others, but there are many multisets with this property, such as the multiset that contains two copies of a and one of b or the multiset that contains three copies of both a and b. The term " multiset " was coined by Nicolaas Govert de Bruijn in the 1970s.

The number of Eulerian circuits in digraphs can be calculated using the so-called BEST theorem, named after de Bruijn, van Aardenne-Ehrenfest, Smith and Tutte.

The original proof was bijective and generalized the de Bruijn sequences.

* T. van Aardenne-Ehrenfest and N. G. de Bruijn, Circuits and trees in oriented linear graphs, Simon Stevin, 28 ( 1951 ), 203-217.

* Tamias eviensis De Bruijn et al., 1980 – Miocene of Greece

In 2003, Ruben van Wendel de Joode, Hans de Bruijn, and Michel van Eeten published a paper entitled Protecting the Virtual Commons: Self-organizing Open Source Communities and Innovative Intellectual Property Regimes.

* Protecting the Virtual Commons: Self-organizing Open Source Communities and Innovative Intellectual Property Regimes, draft version 1. 1, by Ruben van Wendel de Joode, Hans de Bruijn, and Michel van Eeten

The name is an acronym of the names of people who discovered it: de Bruijn, van Aardenne-Ehrenfest, Cedric Smith and Tutte.

* T. van Aardenne-Ehrenfest and N. G. de Bruijn, Circuits and trees in oriented linear graphs, Simon Stevin, 28 ( 1951 ), 203-217.

According to De Bruijn himself, the existence of De Bruijn sequences for each order together with the above properties were first proved, for the case of alphabets with two elements, by Camille Flye Sainte-Marie in 1894, whereas the generalization to larger alphabets is originally due to Tanja van Ardenne-Ehrenfest and himself.

* Mildred Muis, Diana van der Plaats, Inge de Bruijn, and Marianne Muis

Cornelis de Bruijn, from Reizen van Cornelis de Bruyn door de vermaardste Deelen van Klein Asia ( 1698 ).

De reizen door het Nabije Oosten van Cornelis de Bruijn ( ca. 1652 – 1727 ) ( 1997 Leiden and Leuven )

The manufacturer won the European Formula A championship in 2000 with Lewis Hamilton, in 2001 with Carlo Van Dam and in 2004 with Nick De Bruijn.

Before that Carlo Van Dam and Nick De Bruijn ( both Dutch ) won the European Formula A Championship in 2001 and 2004 respectively.

Before that, it was called the philander (“ friend of man ”), which is the name it bears in the second volume of Cornelis de Bruijn's Travels, originally published in 1711 ; the Latin name of this species is called after De Bruijn.

* G is finite ( this is the De Bruijn – Erdős theorem of ).

Therefore, by the De Bruijn – Erdős theorem, P itself also has a w-colorable incomparability graph, and thus has the desired partition into chains.

* Tamias atsali De Bruijn, 1995 – Pliocene of Greece

A diagram showing the De Bruijn sequence where k = 2 and n = 2

In combinatorial mathematics, a k-ary De Bruijn sequence B ( k, n ) of order n, named after the Dutch mathematician Nicolaas Govert de Bruijn, is a cyclic sequence of a given alphabet A with size k for which every possible subsequence of length n in A appears as a sequence of consecutive characters exactly once.

There are distinct De Bruijn sequences B ( k, n ).

The earliest known example of the De Bruijn sequence comes in Sanskrit prosody.

# REDIRECT De Bruijn sequence