FAQ

De Bruijn–Erdős theorem (graph theory)

Known as: De Bruijn-Erdős theorem (graph coloring), De Bruijn–Erdős theorem (graph coloring), De Bruijn 
In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and Paul Erdős (), states that, for every infinite graph G and… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1978-2017
0102019782017

Related topics

Related topics

12 relations
Critical graphEdge coloringEuclidean distanceFour color theorem
(More)

Related mentions per year

Related mentions per year

1944-2018
19401960198020002020
De Bruijn–Erdős theorem (graph theory)
Graph theory
Graph coloring
Euclidean distance
Matching (graph theory)
Edge coloring

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
General Bindings and Alpha-Equivalence in Nominal Isabelle
Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for… (More)
Is this relevant?
2007
2007
Proof Pearl: De Bruijn Terms Really Do Work
Placing our result in a web of related mechanised results, we give a direct proof that the de Bruijn λ-calculus (à la Huet… (More)
  • figure 1
  • table 1
Is this relevant?
2007
2007
Design of Compact, Universal DNA Microarrays for Protein Binding Microarray Experiments
Our group has recently developed a compact, universal protein binding microarray (PBM) that can be used to determine the binding… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2007
2007
A Planning Approach for Message-Oriented Semantic Web Service Composition
In this paper, we consider the problem of composing a set of web services, where the requirements are specified in terms of the… (More)
  • table 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Nominal Techniques in Isabelle/HOL
This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Reliable identification of bounded-length viruses is NP-complete
A virus is a program that replicates itself by copying its code into other files. A common virus protection mechanism involves… (More)
Is this relevant?
1997
1997
Generating De Bruijn Sequences: An Efficient Implementation
This paper presents a concise and efficient implementation of a method of producing De Bruijn sequences. The implementation is… (More)
  • figure 1
Is this relevant?
1993
1993
Closure Under Alpha-Conversion
ion, compute a type for its body in an extended context; to compute a type for an application, compute types for its left and… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Universal cycles for combinatorial structures
Chung, F., P. Diaconis and R. Graham, Universal cycles for combinatorial structures, Discrete Mathematics 110 (1992) 43-59 In… (More)
Is this relevant?
1987
1987
Alternating Step Generators Controlled by De Bruijn Sequences
 
Is this relevant?