of the three-dimensional case of de Bruijn's theorem, based on the algebra of polynomials. The third of de Bruijn's results is that, if a brick is not...
8 KB (1,166 words) - 11:42, 18 August 2023
The De Bruijn–Erdős theorem may refer to: De Bruijn–Erdős theorem (incidence geometry) De Bruijn–Erdős theorem (graph theory) This disambiguation page...
164 bytes (52 words) - 06:06, 28 December 2019
In incidence geometry, the De Bruijn–Erdős theorem, originally published by Nicolaas Govert de Bruijn and Paul Erdős in 1948, states a lower bound on the...
4 KB (407 words) - 01:34, 27 June 2024
De Bruijn notation, a syntax for terms in the λ calculus De Bruijn's theorem, a theorem regarding the packing of bricks into boxes Bruijn De Bruyn De...
2 KB (377 words) - 06:31, 27 December 2022
In graph theory, the De Bruijn–Erdős theorem relates graph coloring of an infinite graph to the same problem on its finite subgraphs. It states that,...
27 KB (3,616 words) - 08:38, 6 May 2024
has media related to Nicolaas Govert de Bruijn (mathematician). Nicolaas Govert de Bruijn's obituary Bruijn N.G. de Archived 2012-03-04 at the Wayback Machine...
8 KB (718 words) - 16:23, 21 September 2024
number Linear-feedback shift register n-sequence BEST theorem Superpermutation de Bruijn (1946). de Bruijn (1975). Brown (1869); Stein (1963); Kak (2000); Knuth...
32 KB (3,515 words) - 19:08, 29 October 2024
references are shown with arrows. De Bruijn indices are commonly used in higher-order reasoning systems such as automated theorem provers and logic programming...
13 KB (1,592 words) - 16:58, 15 August 2024
Dawson–Gärtner theorem (asymptotic analysis) de Branges's theorem (complex analysis) de Bruijn's theorem (discrete geometry) De Bruijn–Erdős theorem (incidence...
73 KB (6,038 words) - 09:58, 20 November 2024
arXiv:2004.07558. Weisstein, Eric W. "Klarner's Theorem". MathWorld. Weisstein, Eric W. "de Bruijn's Theorem". MathWorld. Wikimedia Commons has media related...
22 KB (2,676 words) - 21:01, 23 July 2024
fixed. Circle packing in a rectangle Square packing in a square De Bruijn's theorem: packing congruent rectangular bricks of any dimension into rectangular...
7 KB (949 words) - 22:11, 2 January 2024
provide nontrivial lower bounds for the Furstenberg–Sárközy theorem. The Moser–de Bruijn sequence obeys a property similar to that of a Sidon sequence:...
18 KB (2,428 words) - 03:59, 5 August 2024
In mathematics, the four color theorem, or the four color map theorem, states that no more than four colors are required to color the regions of any map...
48 KB (6,237 words) - 08:20, 17 December 2024
Mutilated chessboard problem (redirect from Gomory's theorem)
puzzle with the clues 1 in one corner and 64 in the opposite corner. De Bruijn's theorem concerns the impossibility of packing certain cuboids into a larger...
30 KB (2,884 words) - 04:19, 16 May 2024
Automated theorem proving (also known as ATP or automated deduction) is a subfield of automated reasoning and mathematical logic dealing with proving...
29 KB (2,945 words) - 12:39, 20 November 2024
The BEST theorem is due to van Aardenne-Ehrenfest and de Bruijn (1951), §6, Theorem 6. Their proof is bijective and generalizes the de Bruijn sequences...
5 KB (540 words) - 05:09, 28 August 2024
polyomino tiling, including the mutilated chessboard problem and De Bruijn's theorem that a rectangle tiled by smaller 1 × n {\displaystyle 1\times n}...
7 KB (796 words) - 21:02, 25 August 2024
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...
15 KB (2,102 words) - 06:46, 13 December 2024
with multiplicity) is b. Theorem: For any non-trivial PBD, v ≤ b. This result also generalizes the Erdős–De Bruijn theorem: For a PBD with λ = 1 having...
4 KB (512 words) - 00:18, 28 February 2024
version of Dilworth's theorem, every finite subset S of P has a w-colorable incomparability graph. Therefore, by the De Bruijn–Erdős theorem, P itself also has...
18 KB (2,429 words) - 21:37, 20 November 2024
Riemann hypothesis (redirect from Critical line theorem)
hypothesis is true, then the theorem is true. If the generalized Riemann hypothesis is false, then the theorem is true. Thus, the theorem is true!! Care should...
126 KB (16,791 words) - 13:28, 8 December 2024
problem Sylvester–Gallai theorem and De Bruijn–Erdős theorem Cauchy's theorem Borsuk's conjecture Schröder–Bernstein theorem Wetzel's problem on families...
5 KB (454 words) - 16:54, 9 December 2024
Equidistributed sequence (redirect from Weyl equidistribution theorem)
sequence is countable, so f is zero almost everywhere. In fact, the de Bruijn–Post Theorem states the converse of the above criterion: If f is a function such...
21 KB (2,394 words) - 18:48, 9 November 2022
Eulerian path (category CS1 German-language sources (de))
circuits in digraphs can be calculated using the so-called BEST theorem, named after de Bruijn, van Aardenne-Ehrenfest, Smith and Tutte. The formula states...
27 KB (3,273 words) - 21:06, 15 December 2024
non-trivial PBD, v ≤ b. This result also generalizes the famous Erdős–De Bruijn theorem: For a PBD with λ = 1 having no blocks of size 1 or size v, v ≤ b...
33 KB (4,362 words) - 01:19, 31 March 2024
informal correspondence is as follows: N. G. de Bruijn used the lambda notation for representing proofs of the theorem checker Automath, and represented propositions...
58 KB (6,359 words) - 20:23, 23 October 2024
leave out "Hausdorff" we get a theorem equivalent to the full axiom of choice. In graph theory, the de Bruijn–Erdős theorem is another equivalent to BPI...
15 KB (2,257 words) - 03:04, 29 November 2023
Erdős theorems de Bruijn–Erdős theorem (graph theory) de Bruijn–Erdős theorem (incidence geometry) Davenport–Erdős theorem Erdős–Anning theorem Erdős–Beck...
3 KB (234 words) - 23:16, 10 August 2024
Line graph (redirect from Whitney graph isomorphism theorem)
properties of the underlying graph from vertices into edges, and by Whitney's theorem the same translation can also be done in the other direction. Line graphs...
43 KB (5,299 words) - 10:28, 5 July 2024
the last sentence in a formal proof is called a theorem of the formal system. The notion of theorem is generally effective, but there may be no method...
5 KB (579 words) - 05:11, 29 July 2024